1612 search results - page 16 / 323 » Analysing Randomized Distributed Algorithms |
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
Three factors are related in analyses of performance curves such as learning curves: the amount of training, the learning algorithm, and performance. Often we want to know whether...
100
Voted
CAV
2001
Springer
15 years 1 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
66
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
80
Voted
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...