390 search results - page 16 / 78 » Computing shortest paths for any number of hops |
182
click to vote
OPODIS
2010
15 years 4 months ago
2010
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
185
click to vote
GISCIENCE
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
198
click to vote
BROADNETS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
170
click to vote
ISVD
2007
IEEE
16 years 28 days ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
157
click to vote
PDCAT
2007
Springer
16 years 23 days ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...