2084 search results - page 24 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
We consider multiprocessor distributed real-time systems where concurrency control is managed using software transactional memory (or STM). For such a system, we propose an algori...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
109
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
WDAG
2005
Springer
15 years 5 months ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...