Advertisement

Extensions & Applications

  • Michael O’Neil
  • Conor Ryan
Part of the Genetic Programming Series book series (GPEM, volume 4)

Abstract

We said in chapter 1 that the beauty of grammars is that they provide a single mechanism that can be used to describe all manner of complex structures. Not only can all sorts of different problems can be tackled simply by changing the grammar, so too can differentalgorithmsbe emulated just by using the appropriate grammar. This chapter gives an overview of current work in extending GE being carried out at various institutions, and demonstrates that GE is more of a family of algorithms, rather than a single method.

Keywords

Logic Program Production Rule Binary String Mapping Rule Context Free Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Michael O’Neil
    • 1
  • Conor Ryan
    • 1
  1. 1.University of LimerickIreland

Personalised recommendations