193 search results - page 26 / 39 » A Lower Bound for the Shortest Path Problem |
114
click to vote
IJCGA
2010
14 years 10 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
TON
1998
14 years 11 months ago
1998
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
100
click to vote
SIAMDM
2010
14 years 10 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
106
click to vote
ICDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
110
click to vote
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...