ALGORITHMICA
2000
13 years 11 months ago
2000
ALGORITHMICA
2000
13 years 11 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
ALGORITHMICA
2000
13 years 11 months ago
2000
ALGORITHMICA
2000
13 years 11 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
ALGORITHMICA
2000
13 years 11 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
ALGORITHMICA
2000
13 years 11 months ago
2000
ALGORITHMICA
2000
13 years 11 months ago
2000
ALGORITHMICA
2000
13 years 11 months ago
2000
ALGORITHMICA
2000
13 years 11 months ago
2000
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...
ALGORITHMICA
2000
13 years 11 months ago
2000
Localization is the process of determining the robot's location within its environment. More precisely, it is a procedure which takes as input a geometric map, a current estim...