Parallel grammatical evolution for circuit optimization

7Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes application of Parallel Grammatical Evolution (PGE) algorithm to combinatorial logic circuit generation. The grammar and algorithms used are described. To increase the efficiency of Grammatical Evolution (GE) the backward processing algorithm was used. Different approaches to create multiobjective fitness functions are described and tested. Specifically the fitness functions are defined as set of rules incorporating different comparison methods in each stage of the computation. The algorithm is internally parallel and consists of three different interconnected populations. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Popelka, O., & Osmera, P. (2008). Parallel grammatical evolution for circuit optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5216 LNCS, pp. 425–430). Springer Verlag. https://doi.org/10.1007/978-3-540-85857-7_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free