76 search results - page 11 / 16 » Monte-Carlo Tree Search Solver |
CISIS
2009
IEEE
14 years 1 months ago
2009
IEEE
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
CP
2005
Springer
13 years 8 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
VLSID
2005
IEEE
14 years 8 days ago
2005
IEEE
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
ICTAI
2003
IEEE
14 years 31 min ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
AUSAI
2004
Springer
14 years 3 days ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...