Abstract
We present a set of extensions to Montana's popular Strongly Typed Genetic Programming system that introduce constraints on the structure of program trees. It is demonstrated that these constraints can be used to evolve programs with a naturally imperative structure, using common high-level imperative language constructs such as loops. A set of three problems including factorial and the general even-n-parity problem are used to test the system. Experimental results are presented which show success rates and required computational effort that compare favourably against other systems on these problems, while providing support for this imperative structure. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Castle, T., & Johnson, C. G. (2012). Evolving high-level imperative program trees with strongly formed genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7244 LNCS, pp. 1–12). https://doi.org/10.1007/978-3-642-29139-5_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
