2084 search results - page 335 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ICDCIT
2005
Springer
15 years 3 months ago
2005
Springer
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
SIAMCOMP
1998
14 years 9 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
103
click to vote
PODC
2011
ACM
14 years 19 days ago
2011
ACM
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...