756 search results - page 86 / 152 » Moving Spaces |
SWAT
1998
Springer
14 years 1 months ago
1998
Springer
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
CVPR
1999
IEEE
14 years 11 months ago
1999
IEEE
In this paper, we present a new method for vision-based, reactive robot navigation that enables a robot to move in the middle of the free space by exploiting both central and peri...
NIPS
2001
13 years 10 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
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...