Sciweavers

209 search results - page 16 / 42
» Randomized consensus algorithms over large scale networks
Sort
View
TSP
2010
13 years 3 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
TSP
2010
13 years 3 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
INFOCOM
2007
IEEE
14 years 2 months ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
INFOCOM
2012
IEEE
11 years 11 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
JMLR
2012
11 years 11 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio