119 search results - page 10 / 24 » Exploring the Regular Tree Types |
128
click to vote
ICGA
2008
15 years 2 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....
113
click to vote
ICLP
2005
Springer
15 years 7 months 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...
128
click to vote
EMNLP
2009
15 years 4 days 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...
117
click to vote
CEC
2009
IEEE
15 years 9 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...
142
Voted
DIS
2001
Springer
15 years 6 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...