2842 search results - page 68 / 569 » Expansion and Search in Networks |
107
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
132
Voted
EENERGY
2010
15 years 5 months ago
2010
Mobile network access has seemingly become ubiquitous in industrialized countries. With data services becoming sufficiently fast, usable, and affordable, demand is growing rapidly...
116
Voted
HEURISTICS
2002
15 years 1 months ago
2002
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
79
Voted
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— A novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces weighted probabilistic forwarding for query me...
111
Voted
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...