Experiments with Explicit For-loops in Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @InProceedings{ciesielski:2004:ewefigp,
-
title = "Experiments with Explicit For-loops in Genetic
Programming",
-
author = "Vic Ciesielski and Xiang Li",
-
pages = "494--501",
-
booktitle = "Proceedings of the 2004 IEEE Congress on Evolutionary
Computation",
-
year = "2004",
-
publisher = "IEEE Press",
-
month = "20-23 " # jun,
-
address = "Portland, Oregon",
-
ISBN = "0-7803-8515-2",
-
keywords = "genetic algorithms, genetic programming, Theory of
evolutionary algorithms",
-
DOI = "doi:10.1109/CEC.2004.1330897",
-
abstract = "Evolving programs with explicit loops presents major
difficulties, primarily due to the massive increase in
the size of the search space. Fitness evaluation
becomes computationally expensive. We have investigated
ways of dealing with these poblems by the evolution of
for-loops of increasing semantic complexity. We have
chosen two problems -- a modified Santa Fe ant problem
and a sorting problem -- which have natural looping
constructs in their solution and a solution without
loops is not possible unless the tree depth is very
large. We have shown that by conrolling the complexity
of the loop structures it is possible to evolve smaller
and more understandable programs for these problems.",
-
notes = "CEC 2004 - A joint meeting of the IEEE, the EPS, and
the IEE.",
- }
Genetic Programming entries for
Victor Ciesielski
Xiang Li
Citations