1434 search results - page 30 / 287 » Distributed Computing with Imperfect Randomness |
120
click to vote
SPDP
1990
IEEE
15 years 8 months ago
1990
IEEE
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...
137
click to vote
KIVS
2005
Springer
15 years 10 months ago
2005
Springer
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
166
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
109
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
134
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...