733 search results - page 45 / 147 » Recommending random walks |
SODA
2012
ACM
13 years 6 days ago
2012
ACM
CIMCA
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
CHI
2009
ACM
15 years 10 months ago
2009
ACM
More and more museums aim at enhancing their visitors' museum experiences in a personalized, intensive and engaging way inside the museum. The CHIP1 (Cultural Heritage Inform...