390 search results - page 58 / 78 » Computing shortest paths for any number of hops |
124
click to vote
AIPS
2010
15 years 4 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
102
click to vote
ADHOCNOW
2007
Springer
15 years 8 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
113
click to vote
SENSYS
2006
ACM
15 years 7 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
146
click to vote
AINA
2005
IEEE
15 years 7 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
109
click to vote
ICNP
2007
IEEE
15 years 8 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...