425 search results - page 43 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ICS
1994
Tsinghua U.
14 years 27 days ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
ADHOC
2007
13 years 9 months ago
2007
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signiï¬...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
TMC
2008
13 years 8 months ago
2008
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...