Computing outside the box: average consensus over dynamic networks
From MaRDI portal
Cites work
- Computing separable functions via gossip
- Convergence speed in distributed consensus and averaging
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed Anonymous Discrete Function Computation
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed average consensus with least-mean-square deviation
- Distributed computation in dynamic networks
- Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
- Distributed Optimization Over Time-Varying Directed Graphs
- Equation of state calculations by fast computing machines
- Fast linear iterations for distributed averaging
- Geometric bounds for convergence rates of averaging algorithms
- Geometric bounds for eigenvalues of Markov chains
- Gossip-based computation of aggregate information
- scientific article; zbMATH DE number 2006642 (Why is no real title available?)
- Linear time average consensus and distributed optimization on fixed graphs
- Monte Carlo sampling methods using Markov chains and their applications
- On Distributed Averaging Algorithms and Quantization Effects
- Push-Sum With Transmission Failures
- Reaching a Consensus
- Stability of multiagent systems with time-dependent communication links
- Synchronization Modulo k in Dynamic Networks
- Towards consensus: some convergence theorems on repeated averaging
This page was built for publication: Computing outside the box: average consensus over dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395545)
