3047 search results - page 77 / 610 » Randomized Parallel Selection |
101
click to vote
ISPDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
100
click to vote
SPAA
2005
ACM
15 years 7 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 (...
117
click to vote
AISC
2008
Springer
15 years 4 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
109
click to vote
PODC
2012
ACM
13 years 4 months ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
127
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...