Sciweavers

2084 search results - page 10 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
TPDS
2010
155views more  TPDS 2010»
13 years 5 months ago
Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming
—In this paper we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divi...
Giuseppe Bianchi, Nicola Blefari-Melazzi, Lorenzo ...
TEC
2010
173views more  TEC 2010»
13 years 2 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
PODC
2010
ACM
13 years 11 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
NIPS
2007
13 years 8 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah