1612 search results - page 176 / 323 » Analysing Randomized Distributed Algorithms |
111
click to vote
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We introduce a model for cooperative coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorith...
109
Voted
JAL
2002
15 years 2 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
105
click to vote
FOCS
1994
IEEE
15 years 6 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
124
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
119
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...