473 search results - page 45 / 95 » Computing shortest paths with uncertainty |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
106
click to vote
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
SSD
2007
Springer
15 years 3 months ago
2007
Springer
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper is concerned with asymptotic observability and stabilizability of dynamical systems over communication channels subject to limited transmission capacity constraint and ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...