Avoiding syntactically incorrect individuals via parameterized operators applied on derivation trees
Ványi R, Zvada S (2003)
Publication Language: English
Publication Status: Published
Publication Type: Conference contribution, Original article
Publication year: 2003
Publisher: IEEE Computer Society
Book Volume: 4
Pages Range: 2791-2798
Article Number: 1299442
Conference Proceedings Title: Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003)
Event location: Canberra, ACT, Australia
ISBN: 0-7803-7804-0
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. © 2003 IEEE.
How to cite
APA:
Ványi, R., & Zvada, S. (2003). Avoiding syntactically incorrect individuals via parameterized operators applied on derivation trees. In Sarker, R. ; Kazi, F. M. A. (Eds.), Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003) (pp. 2791-2798). Canberra, ACT, Australia, AU: IEEE Computer Society.
MLA:
Ványi, Róbert, and Szilvia Zvada. "Avoiding syntactically incorrect individuals via parameterized operators applied on derivation trees." Proceedings of the 2003 Congress on Evolutionary Computation, CEC 2003, Canberra, ACT, Australia Ed. Sarker, R. ; Kazi, F. M. A., IEEE Computer Society, 2003. 2791-2798.
BibTeX: Download