Analytical Tools for Natural Algorithms

Analytical Tools for Natural Algorithms,Bernard Chazelle

Analytical Tools for Natural Algorithms   (Citations: 4)
BibTex | RIS | RefWorks Download
We introduce an analytical tool to study the convergence of bidirectional multiagent agreement systems and use it to sharpen the analysis of various natural algorithms, including flocking, opinion consensus, and synchronization systems. We also improve classic bounds about colored random walks and discuss the usefulness of algorithmic proofs.
Published in 2010.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...The bounds are new, except for the case s < 1, which we established in [7]...
    • ...that we proved in [7]. Theorem 2.4. The velocities of n birds "-converge after n O(n) nontrivial steps, for any " > n cn and any constant...

    Bernard Chazelle. A geometric approach to collective motion

Sort by: