Sciweavers

1186 search results - page 5 / 238
» Improving Random Walk Performance
Sort
View
CCGRID
2010
IEEE
13 years 11 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
CN
2010
51views more  CN 2010»
13 years 10 months ago
Performance of random walks in one-hop replication networks
Luis Rodero-Merino, Antonio Fernández Anta,...
CP
2000
Springer
14 years 2 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 4 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
MSWIM
2006
ACM
14 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari