Parallel Grammatical Evolution for Circuit Optimization

Created by W.Langdon from gp-bibliography.bib Revision:1.8129

@InProceedings{conf/wcecs_2009_II/190,

• title = "Parallel Grammatical Evolution for Circuit Optimization",
• author = "Oldrich Kratochvil and Pavel Osmera and Ondrej Popelka",
• booktitle = "Proceedings of the World Congress on Engineering and Computer Science, WCECS '09",
• year = "2009",
• editor = "S. I. Ao and Craig Douglas and W. S. Grundfest and Jon Burgstone",
• volume = "II",
• pages = "1032--1037",
• address = "San Francisco, USA",
• month = oct # " 20-22",
• publisher = "Newswood Limited",
• organization = "International Association of Engineers",
• keywords = "genetic algorithms, genetic programming, grammatical evolution, circuit optimisation, parallel evolution, BNF",
• isbn13 = "978-988-18210-2-7",
• URL = "http://www.iaeng.org/publication/WCECS2009/WCECS2009_pp1032-1037.pdf",
• size = "6 pages",
• abstract = "This paper describes a Parallel Grammatical Evolution (PGE) that can evolve complete circuits using a variable length of linear genome to govern the mapping of a Backus Naur Form grammar definition. In order to increase the efficiency of Grammatical Evolution (GE) the influence of backward processing and an influence of several fitness functions were tested. PGE with backward processing can also take advantage of progressive crossover and mutation operators. The algorithm is internally parallel and consists of three different interconnected populations. A new non-tree structure of GE was tested.",
• notes = "Lecture Notes in Engineering and Computer Science",

}

Genetic Programming entries for Oldrich Kratochvil Pavel Osmera Ondrej Popelka

Citations