Distributed anonymous function computation in information fusion and multiagent systems
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes, with bounded computation and storage capabilities that do not scale with the network size. Our goal is to characterize the class of functions that can be computed within this model. I...
Main Authors: | Hendrickx, Julien, Olshevsky, Alexander, 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
2010
|
Online Access: | http://hdl.handle.net/1721.1/59370 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Distributed Anonymous Discrete Function Computation
by: Tsitsiklis, John N., et al.
Published: (2012) -
Averaging algorithms and distributed anonymous discrete function computation
by: Tsitsiklis, John N.
Published: (2013) -
MATRIX p-NORMS ARE NP-HARD TO APPROXIMATE IF p not equal to 1, 2, infinity
by: Hendrickx, Julien, et al.
Published: (2011) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2010) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2020)