119 search results - page 10 / 24 » Exploring the Regular Tree Types |
ICGA
2008
13 years 7 months ago
2008
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
ICLP
2005
Springer
14 years 27 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
EMNLP
2009
13 years 5 months ago
2009
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependen...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
DIS
2001
Springer
13 years 12 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...