Abstract
Grammatical Evolution (GE) is a novel evolutionary algorithm that uses a genotype-to-phenotype mapping process where variable-length binary strings govern which production rules of a Backus Naur Form grammar are used to generate programs. This paper describes the Java GE project (jGE), which is an implementation of GE in the Java language, as well as some proof-of-concept experiments. The main idea behind the jGE Library is to create a framework for evolutionary algorithms which can be extended to any specific implementation such as Genetic Algorithms, Genetic Programming and Grammatical Evolution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
