193 search results - page 30 / 39 » A Lower Bound for the Shortest Path Problem |
106
Voted
ALGOSENSORS
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
101
click to vote
CCCG
2008
15 years 1 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
111
click to vote
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...