2924 search results - page 3 / 585 » Lower Bounds in Distributed Computing |
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.