246 search results - page 27 / 50 » Dynamic Local Search for the Maximum Clique Problem |
74
Voted
ICRA
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
105
click to vote
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
ASIAN
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
HIPC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using o...
AAAI
1998
14 years 11 months ago
1998
The problem of concurrent mapping and localization has received considerable attention in the mobile robotics community. Existing approachescan largely be grouped into two distinc...