2924 search results - page 448 / 585 » Lower Bounds in Distributed Computing |
135
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
139
click to vote
ICDCS
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents a new method to control the delay performance for high rate heterogeneous real-time traffic flows based on a novel traffic control algorithm which is a gene...
155
click to vote
SPDP
1993
IEEE
15 years 8 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
126
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
180
Voted
DCOSS
2011
Springer
14 years 4 months ago
2011
Springer
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...