Sciweavers

176 search results - page 15 / 36
» Fast Periodic Correction Networks
Sort
View
COLT
2007
Springer
15 years 3 months ago
Observational Learning in Random Networks
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
Julian Lorenz, Martin Marciniszyn, Angelika Steger
MIDDLEWARE
2010
Springer
14 years 7 months ago
The Gossple Anonymous Social Network
While social networks provide news from old buddies, you can learn a lot more from people you do not know, but with whom you share many interests. We show in this paper how to bui...
Marin Bertier, Davide Frey, Rachid Guerraoui, Anne...
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 2 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
SSS
2009
Springer
15 years 2 months ago
An Optimal Self-stabilizing Firing Squad
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of e...
Danny Dolev, Ezra N. Hoch, Yoram Moses
GLOBECOM
2007
IEEE
15 years 3 months ago
Heuristics for the Design and Optimization of Streaming Content Distribution Networks
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
Sandjai Bhulai, Robert D. van der Mei, Mengxiao Wu