2084 search results - page 207 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
74
Voted
ICPPW
2005
IEEE
15 years 3 months ago
2005
IEEE
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
85
Voted
AAAI
2008
15 years 17 days ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
100
Voted
COCO
2008
Springer
15 years 1 days ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
101
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
89
Voted
MOBIHOC
2005
ACM
15 years 9 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...