One of the important basic tasks in computing is the finding of all occurrences of a particular alphanumeric string in a document, or the finding of all documents that have one or more occurrences of a given alphanumeric string. One common example...

String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be an...

The goal of solving a site search problem is to allocate a contiguous set of land parcels such that the total land acquisition cost, or other objectives, are optimized. This article describes the design and implementation of an evolutionary algorithm (EA) that can...

ABSTRACT In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for...