1614 search results - page 132 / 323 » Breadth-First Heuristic Search |
118
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
155
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
148
click to vote
AI
2002
Springer
15 years 4 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...
157
click to vote
IPPS
2010
IEEE
15 years 2 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...
146
click to vote
GLVLSI
2009
IEEE
15 years 11 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...