1434 search results - page 222 / 287 » Distributed Computing with Imperfect Randomness |
137
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
142
click to vote
OPODIS
2010
15 years 2 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
147
click to vote
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
159
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the fully distributed Video-on-Demand problem, where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less between ...
171
click to vote
TELETRAFFIC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Renewed interest in ALOHA-based Medium Access Control (MAC) protocols stems from their proposed applications to wireless ad hoc and sensor networks that require distribut...