81 search results - page 5 / 17 » Learning Probabilistic Tree Grammars for Genetic Programming |
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
GECCO
2010
Springer
14 years 5 days ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
IWANN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The aim of this paper is to present a new tool of multiple instance learning which is designed using a grammar based genetic programming (GGP) algorithm. We study its app...
EMNLP
2004
13 years 8 months ago
2004
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...