Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Gossip algorithms"”.
-
A study of gossip algorithms for internet-scale cardinality estimation of distributed XML data
… component of query optimization. Decentralized gossip-based protocols are very popular in networking, and in particular, in sensor networks. The simplicity and scalability of gossip protocols render them perfect for quickly computing accurate estimates of aggregates (sums, averages, etc.) in …
-
Information Propagation Algorithms for Consensus Formation in Decentralized Multi-Agent Systems
… evidence for Stochastic Local Observation/Gossip (SLOG) algorithms as a new class of solutions to the decentralized consensus problem for multi-agent systems that lack a centralized controller, with the additional constraints that agents act asynchronously, information is discrete, and all …
-
Cooperative Strategies for Near-Optimal Computation in Wireless Networks
… that existing con- sensus strategies, such as gossip algorithms, are nearly order optimal in the energy expended but strictly suboptimal in the other metrics. I propose a new consensus strategy, tailored to the wireless medium and cooperative in nature, termed hierarchical averaging. …
-
Analyzing the opinion dynamics models discrete & continuous
… convergence of an especial case of averaging gossip algorithms.
-
Consensus Algorithms for Estimation and Discrete Averaging in Networked Control Systems
In this thesis several topics on consensus and gossip algorithms for multi-agent systems are addressed. An agent is a dynamical system that can be fully described by a state-space representation of its dynamics. A multi-agent system is a network of agents whose pattern of interactions or couplings …
-
Probabilistic methods for distributed information dissemination
… bottleneck. In this thesis, we develop new algorithms and techniques to address these challenges. In particular we concentrate on broadcast and information dissemination tasks and introduce novel ideas on how randomization can lead to powerful, simple and practical communication primitives …
-
Αρχιτεκτονικές λογισμικού για περιβάλλοντα επίλυσης προβλημάτων και εφαρμογές στο ασύγχρονο μοντέλο υπολογισμού
… υπολογισμού στατιστικών μεγεθών, τους gossip αλγορίθμους, σε κάθε στοιχειώδες βήμα των οποίων μόνο δύο οντότητες επικοινωνούν και υπολογίζουν. Επεκτείνουμε αυτούς τους αλγορίθμους επιτρέποντας σε k > 2 οντότητες να αλληλεπιδρούν ανά βήμα, προσομοιώνουμε τη συμπεριφορά τους και …