866 search results - page 112 / 174 » On Dynamic Shortest Paths Problems |
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
NCA
2007
IEEE
15 years 4 months ago
2007
IEEE
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
106
click to vote
ICNP
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
IJRR
2010
14 years 7 months ago
2010
Abstract We address the problem of vision-based navigation in busy inner-city locations, using a stereo rig mounted on a mobile platform. In this scenario semantic information beco...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...