An Analysis of Explicit Loops in Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @InProceedings{li:2005:CECx,
-
author = "Xiang Li and Vic Ciesielski",
-
title = "An Analysis of Explicit Loops in Genetic Programming",
-
booktitle = "Proceedings of the 2005 IEEE Congress on Evolutionary
Computation",
-
year = "2005",
-
editor = "David Corne and Zbigniew Michalewicz and
Marco Dorigo and Gusz Eiben and David Fogel and Carlos Fonseca and
Garrison Greenwood and Tan Kay Chen and
Guenther Raidl and Ali Zalzala and Simon Lucas and Ben Paechter and
Jennifier Willies and Juan J. Merelo Guervos and
Eugene Eberbach and Bob McKay and Alastair Channon and
Ashutosh Tiwari and L. Gwenn Volkert and
Dan Ashlock and Marc Schoenauer",
-
volume = "3",
-
pages = "2522--2529",
-
address = "Edinburgh, UK",
-
publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
08855-1331, USA",
-
month = "2-5 " # sep,
-
organisation = "IEEE Computational Intelligence Society, Institution
of Electrical Engineers (IEE), Evolutionary Programming
Society (EPS)",
-
publisher = "IEEE Press",
-
keywords = "genetic algorithms, genetic programming, iteration,
forloops, modified ant, ADL, STGP",
-
ISBN = "0-7803-9363-5",
-
DOI = "doi:10.1109/CEC.2005.1555010",
-
abstract = "we analyse the reasons why evolving programs with a
restricted form of loops is superior to evolving
programs without loops for two problems which have
underlying repetitive characteristics - a visit every-
square problem and a modified Santa Fe ant problem. We
show that in the case of loops there is a larger number
of solutions with smaller tree sizes. We show that the
computational patterns captured in the bodies of the
loops are reflective of repeating patterns in the
domain. We show that the increased computational cost
of evaluating an individual can be controlled by domain
knowledge.",
-
notes = "CEC2005 - A joint meeting of the IEEE, the IEE, and
the EPS.",
- }
Genetic Programming entries for
Xiang Li
Victor Ciesielski
Citations