Sciweavers

733 search results - page 55 / 147
» Recommending random walks
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 4 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
IJAHUC
2008
118views more  IJAHUC 2008»
14 years 10 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
RECSYS
2009
ACM
15 years 4 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ...
Benjamin M. Marlin, Richard S. Zemel
STACS
2009
Springer
15 years 4 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 4 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld