1434 search results - page 54 / 287 » Distributed Computing with Imperfect Randomness |
133
click to vote
JDA
2008
15 years 4 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
143
click to vote
ICDCS
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
117
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
135
click to vote
ISPAN
1999
IEEE
15 years 8 months ago
1999
IEEE
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
158
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...