473 search results - page 46 / 95 » Computing shortest paths with uncertainty |
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
ICNSC
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper presents ceiling light landmarks based localization and motion control for a mobile robot. The novel mechanism design for the mobile robot is introduced, and the meth...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Sampling-based algorithms have dramatically improved the state of the art in robotic motion planning. However, they make restrictive assumptions that limit their applic...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
LCN
2003
IEEE
15 years 3 months ago
2003
IEEE
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...