IJRR
2010
13 years 1 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
AAAI
2000
13 years 6 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
ICCS
2003
Springer
13 years 9 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...