338 search results - page 29 / 68 » Fast distributed random walks |
STACS
2007
Springer
15 years 3 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
TACAS
2005
Springer
15 years 3 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
67
Voted
AIRS
2004
Springer
15 years 3 months ago
2004
Springer
Carrying out experiments in Information Retrieval is a heavy activity requiring fast tools to treat collections of significant size, and at the same time flexible tools to leave...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...