Thesis Details
Metody kódování problému v evolučním návrhu kombinačních obvodů
The thesis compares two different approaches to combinational circuit encoding for automated circuit design which uses evolutionary algorithms. The comparison was made between cartesian genetic programming and circuit represented in the algebraic normal form. Both methods were evaluated on a chosen set of circuits. The first test case criterion was the convergence of each particular method. The second optimization criterion was the area used on a chip. For accelerating the evaluation of fitness a parallel simulation was used. Implementation is in programming language C++ with Boost library. The pros and cons of both methods are summarised at the end of this work.
CGP, evolutionary design of combinational circuits, genetic programming, cartesian genetic programming, comparison of circuit encodings, artificial intelligence, ANF, algebraic normal form
Holík Lukáš, doc. Mgr., Ph.D. (DITS FIT BUT), člen
Hradiš Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Jaroš Jiří, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT), člen
@bachelorsthesis{FITBT23857,
author = "Adam Sedl\'{a}\v{c}ek",
type = "Bachelor's thesis",
title = "Metody k\'{o}dov\'{a}n\'{i} probl\'{e}mu v evolu\v{c}n\'{i}m n\'{a}vrhu kombina\v{c}n\'{i}ch obvod\r{u}",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2021,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/23857/"
}