168 search results - page 26 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
118
click to vote
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
111
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
101
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
CPC
1998
14 years 11 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
131
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...