Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
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...
Maya Dimitrova, Emilia I. Barakova, Tino Lourens, ...
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...
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...
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...