Created by W.Langdon from gp-bibliography.bib Revision:1.8120
In this contribution we propose a framework-independent definition language for GP problems that can reduce the required effort and facilitate the integration of new problem types. We draw a parallel between the implementation of compilers for programming languages and the implementation of GP problems and reuse the well-established concept of attributed grammars with semantic actions to define computational symbols, semantics and structural constraints for GP. This goes beyond previous work in the area of context-free-grammar GP and grammatical evolution, because we also interweave the definition of symbol semantics and the target function with the definition of the grammar.
This paper describes the proposed GP problem definition language (GPDL) and exemplary definitions of two popular benchmark problems using GPDL. We also describe a reference implementation of a GPDL compiler for HeuristicLab.",
hyper-heuristic. 4-bit multiple output multiplier. Generate custom GP system, CodeDom c#
Also known as \cite{2482713} Distributed at GECCO-2013.",
Genetic Programming entries for Gabriel Kronberger Michael Kommenda Stefan Wagner Heinz Dobler