473 search results - page 30 / 95 » Computing shortest paths with uncertainty |
127
click to vote
TON
2008
15 years 4 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
128
click to vote
TON
2002
15 years 4 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
135
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
156
click to vote
IJRR
2011
14 years 7 months ago
2011
— This paper presents LQG-MP (linear-quadratic Gaussian motion planning), a new approach to robot motion planning that takes into account the sensors and the controller that will...
113
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...