1983 search results - page 7 / 397 » Competitive graph searches |
91
Voted
DAGSTUHL
2006
15 years 4 months ago
2006
We consider the problem of a searcher that looks for a lost flashlight in a dusty environment. The search agent finds the flashlight as soon as it crosses the ray emanating from t...
125
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
115
Voted
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
124
Voted
COMPGEOM
1994
ACM
15 years 6 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
147
Voted
SWAT
2010
Springer
15 years 7 months ago
2010
Springer
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...