473 search results - page 84 / 95 » Computing shortest paths with uncertainty |
ICRA
2009
IEEE
14 years 7 months ago
2009
IEEE
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
SIGCOMM
1999
ACM
15 years 1 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
70
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
136
click to vote
Publication
Transportation specialists, urban planners, and public health officials have
been steadfast in encouraging active modes of transportation over the past decades.
Conventional thin...
101
click to vote
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...