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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
O’Neil, M., Ryan, C. (2003). Extensions & Applications. In: Grammatical Evolution. Genetic Programming Series, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0447-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0447-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5081-1
Online ISBN: 978-1-4615-0447-4
eBook Packages: Springer Book Archive