Sciweavers

18306 search results - page 394 / 3662
» Algorithmics in Exponential Time
Sort
View
237
Voted
FSTTCS
1998
Springer
15 years 11 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 7 months ago
Communication under Strong Asynchronism
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
Aslan Tchamkerten, Venkat Chandar, Gregory W. Worn...
ATAL
2008
Springer
15 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
2010
Springer
206views Algorithms» more  WDAG 2010»
15 years 5 months ago
Scalable Quantum Consensus for Crash Failures
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 11 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola