Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in
business, engineering, economics and science cannot be tackled with any reasonable hope …

Summary In Shakespeare's Henry IV Part 1, the Scottish rebel, the Earl of Douglas, engages
in a visual search task. He is searching for King Henry in a field full of soldiers who are not
King Henry (known in the search trade as 'distractors'). The problem is that some of those …

ABSTRACT Activities such as Web Services and the Semantic Web are working to create a
web of distributed machine understandable data. In this paper we present an application
called'Semantic Search'which is built on these supporting technologies and is designed to …

An important component of routine visual behavior is the ability to find one item in a visual
world filled with other, distracting items. This ability to perform visual search has been the
subject of a large body of research in the past 15 years. This paper reviews the visual search  …

This paper presents the fundamental principles underlying tabu search as a strategy for
combinatorial optimization problems. Tabu search has achieved impressive practical
successes in applications ranging from scheduling and computer channel balancing to …

This paper addresses the problem of generating possible object locations for use in object
recognition. We introduce selective search which combines the strength of both an
exhaustive search and segmentation. Like segmentation, we use the image structure to …

The problem of concept learning, or forming a general description of a class of objects given
a set of examples and non-examples, is viewed here as a search problem. Existing
programs that generalize from examples are characterized in terms of the classes of search  …

This is the second half of a two part series devoted to the tabu search metastrategy for
optimization problems. Part I introduced the fundamental ideas of tabu search as an
approach for guiding other heuristics to overcome the limitations of local optimality, both in a …

Systematic change of neighborhood within a local search algorithm yields a simple and
effective metaheuristic for combinatorial optimization. We present a basic scheme for this
purpose which can be implemented easily using any local search algorithm as a subroutine …

In this book, we study theoretical and practical aspects of computing methods for
mathematical modelling of nonlinear systems. A number of computing techniques are
considered, such as methods of operator approximation with any given accuracy; operator …