نتایج جستجو برای: gossip algorithm

تعداد نتایج: 755117  

Journal: :Historical Papers 2006

Journal: :Simulation 2012
Francesca Giardini Rosaria Conte

In this work we propose a theory of gossip as a means for social control. Exercising social control roughly means to isolate and to punish cheaters. However, punishment is costly and it inevitably implies the problem of second-order cooperation. Moving from a cognitive model of gossip, we report data from ethnographic studies and agent-based simulations to support our claim that gossip reduces ...

1994
Juraj Hromkovic Ralf Klasing Walter Unger Hubert Wagener

The communication power of the one-way and two-way edge-disjoint path modes for broadcast and gossip is investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). The main results achieved are the following: 1. For each connected graph G n of n nodes, the complexity of broadcast in G n , B min (G n), satisses dlog 2 ne B min (G n) dlog 2 ...

Journal: :CoRR 2011
Pascal Bianchi Jérémie Jakubowicz

We introduce a new framework for the convergence analysis of a class of distributed constrained non-convex optimization algorithms in multi-agent systems. The aim is to search for local minimizers of a non-convex objective function which is supposed to be a sum of local utility functions of the agents. The algorithm under study consists of two steps: a local stochastic gradient descent at each ...

2010
S. Sundhar Ram Angelia Nedić Venu V. Veeravalli

1 Electrical and Computer Engineering Department, University of Illinois at Urbana-Champaign, Urbana IL 61801, USA [email protected] 2 Industrial and Enterprise Systems Engineering Department, University of Illinois at Urbana-Champaign, Urbana IL 61801, USA [email protected] 3 Electrical and Computer Engineering Department, University of Illinois at Urbana-Champaign, Urbana IL 61801, USA...

Journal: :SIAM J. Discrete Math. 1998
Artur Czumaj Leszek Gasieniec Andrzej Pelc

Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...

2015
S. pishyar A. Ghiasian M. R. Khayyambashi

Many advances have been made in wireless sensor networks (WSNs) which are as varied as the applications; and many more are in progress. There are some intrinsic limitations related to WSNs, including scarcity of energy supply, limited processing ability, and lack of processing memory. One of the important considerations of network designers is to devise protocols and algorithms in order to tack...

2011
Mauro Franceschelli Daniele Rosa Carla Seatzu Francesco Bullo

In this paper we address the heterogeneous multi-vehicle routing problem by proposing a distributed algorithm based on gossip. We consider the case where a set of tasks arbitrarily distributed in a plane, each with a service cost, have to be served by a set of mobile robots, each with a given movement speed and task execution speed. Our goal is to minimize the maximum execution time of robots.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید