Sciweavers

229 search results - page 7 / 46
» Search performance analysis and robust search algorithm in u...
Sort
View
ICC
2007
IEEE
14 years 1 months ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen
CIKM
2004
Springer
14 years 1 months ago
The robustness of content-based search in hierarchical peer to peer networks
Hierarchical peer to peer networks with multiple directory services are an important architecture for large-scale file sharing due to their effectiveness and efficiency. Recent ...
M. Elena Renda, Jamie Callan
IPPS
2008
IEEE
14 years 2 months ago
On the need for query-centric unstructured peer-to-peer overlays
—Hybrid P2P systems rely on the assumption that sufficient objects exist nearby in order to make the unstructured search component efficient. This availability depends on the o...
William Acosta, Surendar Chandra
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 7 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle