112 search results - page 9 / 23 » A Shogi Program Based on Monte-Carlo Tree Search |
102
click to vote
ENTCS
2002
14 years 9 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
67
Voted
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
AUSAI
2004
Springer
15 years 3 months 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...