1589 search results - page 133 / 318 » Multiple-Goal Heuristic Search |
136
Voted
AI
2002
Springer
15 years 3 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
143
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
133
Voted
GLVLSI
2009
IEEE
15 years 10 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
129
Voted
WEBI
2009
Springer
15 years 10 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
118
Voted
EVOW
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...