580 search results - page 40 / 116 » Choosing a random peer |
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
106
click to vote
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
107
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
ISTCS
1993
Springer
15 years 3 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
101
click to vote
IEICET
2007
14 years 11 months ago
2007
From the appearance of CodeRed and SQL Slammer worm, we have learned that the early detection of worm epidemics is important to reduce the damage caused by their outbreak. One prom...