Sciweavers

45 search results - page 5 / 9
» Hamiltonicity of Topological Grid Graphs
Sort
View
TSP
2008
100views more  TSP 2008»
13 years 7 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
PC
2007
118views Management» more  PC 2007»
13 years 6 months ago
Peer-to-peer systems for discovering resources in a dynamic grid
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...
SC
2003
ACM
14 years 18 days ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
GLOBECOM
2010
IEEE
13 years 5 months ago
Compact Wakeup Scheduling in Wireless Sensor Networks
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
Junchao Ma, Wei Lou
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...