Sciweavers

417 search results - page 29 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
ATAL
2007
Springer
14 years 3 months ago
Distributed task allocation in social networks
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
Mathijs de Weerdt, Yingqian Zhang, Tomas Klos
SPAA
2003
ACM
14 years 2 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
IJSNET
2007
155views more  IJSNET 2007»
13 years 8 months ago
Distributed Bayesian fault diagnosis of jump Markov systems in wireless sensor networks
: A Bayesian distributed online change detection algorithm is proposed for monitoring a dynamical system by a wireless sensor network. The proposed solution relies on modelling the...
Hichem Snoussi, Cédric Richard
COMCOM
2004
98views more  COMCOM 2004»
13 years 8 months ago
End system multicast: an architectural infrastructure and topological optimization
Although IP-multicast has been proposed and investigated for years, there are major problems inherent in the IP-multicasting technique, e.g., difficulty to scale up the system, di...
Starsky H. Y. Wong, John C. S. Lui
STACS
2012
Springer
12 years 4 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...