1612 search results - page 27 / 323 » Analysing Randomized Distributed Algorithms |
CSR
2007
Springer
13 years 11 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
SPDP
1990
IEEE
13 years 11 months ago
1990
IEEE
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Most publications on the capacity and performance of wireless ad hoc networks share the underlying assumption of a uniform random distribution of nodes. In this paper, we study ...
JACM
2011
13 years 2 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...