2168 search results - page 48 / 434 » Randomized Algorithms and Complexity Theory |
139
click to vote
SPAA
2009
ACM
15 years 9 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...
IPL
2008
15 years 2 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
92
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
115
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
114
Voted
EC
2000
15 years 2 months ago
2000
We evaluate whether John Holland's Echo model exemplifies his theory of complex adaptive systems. After reviewing Holland's theory of complex adaptive systems and descri...