Sciweavers

2084 search results - page 24 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
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...
Satish Babu Korada, Nicolas Macris
DATE
2009
IEEE
172views Hardware» more  DATE 2009»
14 years 2 months ago
On bounding response times under software transactional memory in distributed multiprocessor real-time systems
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...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 4 months ago
Testing monotone high-dimensional distributions
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...
Ronitt Rubinfeld, Rocco A. Servedio
ATAL
2008
Springer
13 years 9 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
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...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 27 days ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...