2084 search results - page 35 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
108
Voted
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
77
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
115
click to vote
RTCSA
1998
IEEE
15 years 1 months ago
1998
IEEE
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
69
Voted
DC
2000
14 years 9 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...