Parallel Grammatical Evolution with Backward Processing

This paper describes parallel grammatical evolution (PGE) that can evolve complete programs using a variable length linear genome to govern the mapping of a Backus Naur form grammar definition. To increase the efficiency of grammatical evolution (GE) the influence of backward processing was tested....

Full description

Saved in:
Bibliographic Details
Main Authors: Osmera, P., Popelka, O., Pivonka, P.
Format: Conference Proceeding
Language:English
Subjects:
Automation
backward processing
Bioinformatics
Computer science
Evolution (biology)
Genetic programming
Genomics
grammatical evolution
Mechanical engineering
Paper technology
parallel evolution
Production
Testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes parallel grammatical evolution (PGE) that can evolve complete programs using a variable length linear genome to govern the mapping of a Backus Naur form grammar definition. To increase the efficiency of grammatical evolution (GE) the influence of backward processing was tested. The significance of backward coding (BC) and the comparison with standard coding of GEs is presented. BC can speed up grammatical evolution with high quality features. The adaptive significance of parallel grammatical evolution with "male" and "female" populations has been studied
DOI:10.1109/ICARCV.2006.345302