Averaging algorithms and distributed anonymous discrete function computation
In distributed consensus and averaging algorithms, processors exchange and update certain values ("estimates" or "opinions") by forming a local average with the values of their neighbors. Under suitable conditions, such algorithms converge to consensus (every processor ends up ho...
Main Author: | Tsitsiklis, John N. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2013
|
Online Access: | http://hdl.handle.net/1721.1/79646 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Distributed Anonymous Discrete Function Computation
by: Tsitsiklis, John N., et al.
Published: (2012) -
Distributed anonymous function computation in information fusion and multiagent systems
by: Hendrickx, Julien, et al.
Published: (2010) -
On Distributed Averaging Algorithms and Quantization Effects
by: Tsitsiklis, John N., et al.
Published: (2010) -
A lower bound for distributed averaging algorithms on the line graph
by: Tsitsiklis, John N., et al.
Published: (2012) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2010)