148 search results - page 17 / 30 » Optimizing random walk search algorithms in P2P networks |
118
click to vote
SAT
2010
Springer
14 years 10 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
ICDE
2008
IEEE
15 years 6 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
105
click to vote
CDC
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...