335 search results - page 17 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
TON
2008
13 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
EOR
2006
13 years 7 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...