478 search results - page 15 / 96 » A simple expected running time analysis for randomized |
WDAG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
STOC
1992
ACM
14 years 14 days ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Recent years have witnessed an increasing number of studies in stream mining, which aim at building an accurate model for continuously arriving data. Somehow most existing work ma...