91 search results - page 6 / 19 » Information-theoretic approaches to branching in search |
ICTAI
2003
IEEE
14 years 1 months 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...
AIMSA
2004
Springer
14 years 1 months ago
2004
Springer
The reward-based autobiographical memory approach has been applied to the Web search agent. The approach is based on the analogy between the Web and the environmental exploration b...
CP
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
AAAI
2000
13 years 10 months ago
2000
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
KBSE
2003
IEEE
14 years 1 months ago
2003
IEEE
The use of techniques for automating the generation of software test cases is very important as it can reduce the time and cost of this process. The latest methods for automatic g...