129 search results - page 9 / 26 » Optimal solutions for moving target search |
TSMC
1998
14 years 11 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
WAPCV
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper proposes a neuronal-based solution to active visual search, that is, visual search for a given target in displays that are too large in spatial extent to be in...
103
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
PPL
2010
14 years 6 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...