27 search results - page 2 / 6 » wdag 2007 |
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...