866 search results - page 123 / 174 » On Dynamic Shortest Paths Problems |
ICNP
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
SIGCOMM
1999
ACM
14 years 2 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...
BMCBI
2010
13 years 9 months ago
2010
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many...