2084 search results - page 206 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
65
Voted
SPAA
1990
ACM
15 years 2 months ago
1990
ACM
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
80
Voted
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
CSCLP
2006
Springer
15 years 1 months ago
2006
Springer
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
78
Voted
SIGMETRICS
2006
ACM
15 years 4 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...