353 search results - page 24 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
128
Voted
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
132
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
124
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
101
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
129
click to vote
ICCV
2007
IEEE
15 years 9 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...