Sciweavers

3247 search results - page 234 / 650
» Randomized smoothing networks
Sort
View
TSP
2010
15 years 14 days ago
Greedy gossip with eavesdropping
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
GCC
2003
Springer
15 years 11 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
ICALP
2010
Springer
15 years 10 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
160
Voted
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
15 years 5 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
IJMC
2010
139views more  IJMC 2010»
15 years 4 months ago
A realistic mobility model for wireless networks of scale-free node connectivity
: Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free powerlaw connectivity distribution and a few densely po...
Sunho Lim, Chansu Yu, Chita R. Das