1612 search results - page 25 / 323 » Analysing Randomized Distributed Algorithms |
FOCI
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
IPPS
1998
IEEE
13 years 11 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 ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...