Avoiding syntactically incorrect individuals via parameterized operators applied on derivation trees

Created by W.Langdon from gp-bibliography.bib Revision:1.4420

  author =       "Robert Vanyi and Szilvia Zvada",
  title =        "Avoiding syntactically incorrect individuals via
                 parameterized operators applied on derivation trees",
  booktitle =    "Proceedings of the 2003 Congress on Evolutionary
                 Computation CEC2003",
  year =         "2003",
  editor =       "Ruhul Sarker and Robert Reynolds and 
                 Hussein Abbass and Kay Chen Tan and Bob McKay and Daryl Essam and 
                 Tom Gedeon",
  volume =       "4",
  pages =        "2791--2798",
  publisher =    "IEEE Press",
  address =      "Canberra",
  publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
                 08855-1331, USA",
  month =        "8-12 " # dec,
  organisation = "IEEE Neural Network Council (NNC), Engineers Australia
                 (IEAust), Evolutionary Programming Society (EPS),
                 Institution of Electrical Engineers (IEE)",
  keywords =     "genetic algorithms, genetic programming, context-free
                 grammar, context-free language, derivation trees,
                 evolutionary algorithm, parametrised operators,
                 syntactically incorrect individuals, context-free
                 languages, context-sensitive grammars, evolutionary
                 computation, trees mathematics",
  ISBN =         "0-7803-7804-0",
  URL =          "http://www2.informatik.uni-erlangen.de/publication/download/vanyi_zvada_cec2003.ps.gz",
  DOI =          "doi:10.1109/CEC.2003.1299442",
  size =         "8 pages",
  abstract =     "Evolutionary algorithms can be efficiently used to
                 solve many different problems, without knowing much
                 about the nature of the solution. One of the most
                 appreciated property of these algorithms is simplicity.
                 However, this simplicity causes an unguided nature;
                 superfluous or even invalid individuals may be produced
                 taking valuable time from the algorithm. In this paper
                 a preliminary method is described for avoiding such
                 individuals during the evolution of strings from a
                 context-free language. Our method operates on the
                 derivation trees of the underlying context-free grammar
                 and keeps nevertheless the simplicity and randomness of
                 the evolutionary algorithms. Though the system is
                 designed for context-free languages, the method can be
                 extended to higher level languages, too.",
  notes =        "CEC 2003 - A joint meeting of the IEEE, the IEAust,
                 the EPS, and the IEE.

                 Also known as \cite{1299442}",

Genetic Programming entries for Robert Vanyi Szilvia Zvada