Sciweavers

2270 search results - page 263 / 454
» On the distribution of eigenvalues of graphs
Sort
View
SIROCCO
2008
15 years 8 months ago
Self-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
Thomas Sauerwald, Dirk Sudholt
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 6 months ago
Network-based consensus averaging with general noisy channels
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
Ram Rajagopal, Martin J. Wainwright
ECCC
2010
82views more  ECCC 2010»
15 years 6 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Ran Raz
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 4 months ago
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
Francesc Comellas, Jesus Martinez-Navarro