Prof. Ing. Lukáš Sekanina, Ph.D.
| GAJDA Zbyšek and SEKANINA Lukáš. When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?. In: Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010. New York: Association for Computing Machinery, 2010, pp. 983-984. ISBN 978-1-4503-0072-8. | | Publication language: | english |
|---|
| Original title: | When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly? |
|---|
| Title (cs): | Kdy kartézské genetické programování implicitně minimalizuje velikost fenotypu? |
|---|
| Pages: | 983-984 |
|---|
| Proceedings: | Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010 |
|---|
| Conference: | Genetic and Evolutionary Computations Conference 2010 |
|---|
| Place: | New York, US |
|---|
| Year: | 2010 |
|---|
| ISBN: | 978-1-4503-0072-8 |
|---|
| Publisher: | Association for Computing Machinery |
|---|
| Keywords |
|---|
| genetic programming, digital circuits, evolutionary design |
| Annotation |
|---|
A new method is proposed to minimize the number of gates in combinational circuits using Cartesian Genetic Programming (CGP). We show that when the selection of the parent individual is performed on basis of its functionality solely (neglecting thus the phenotype size) smaller circuits can be evolved even if the number of gates is not considered by a fitness function. This phenomenon is confirmed on the evolutionary design of combinational multipliers.
|
| BibTeX: |
|---|
@INPROCEEDINGS{
author = {Zby{\v{s}}ek Gajda and Luk{\'{a}}{\v{s}} Sekanina},
title = {When Does Cartesian Genetic Programming Minimize
the Phenotype Size Implicitly?},
pages = {983--984},
booktitle = {Proceeding of Genetic and Evolutionary Computation
Conference, GECCO 2010},
year = 2010,
location = {New York, US},
publisher = {Association for Computing Machinery},
ISBN = {978-1-4503-0072-8},
language = {english},
url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9249}
} |
|
Faculty of Information Technology