1 |
Automatizovaný návrh obrazových filtrů na základě kartézského genetického programování / Towards the Automatic Design of Image Filters Based on Cartesian Genetic ProgrammingKečkéš, Miroslav January 2012 (has links)
The aim of this diploma thesis is using cartesian genetic programming on design image filters and creating basic structure for implement diferent type of problems. Genetic programming is rapidly growing method, which often using for solve dificult problems. This thesis analyze basic principle, way of application and implementing this method to design filters. Result of this thesis is program realize design filters define by specific parameters, overview of implementig method and achieve summary from this sphere.
|
2 |
Sebemodifikující se programy v kartézském genetickém programování / Self-Modifying Programs in Cartesian Genetic ProgrammingMinařík, Miloš January 2010 (has links)
During the last years cartesian genetic programming proved to be a very perspective area of the evolutionary computing. However it has its limitations, which make its use in area of large and generic problems impossible. These limitations can be eliminated using the recent method allowing self-modification of programs in cartesian genetic programming. The purpose of this thesis is to review the development in this area done so far. Next objective is to design own solutions for solving various problems that are hardly solvable using the ordinary cartesian genetic programming. One of the problems to be considered is generating the terms of various Taylor series. Due to the fact that the solution to this problem requires generalisation, the goal is to prove that the self-modifying cartesian genetic programming scores better than classic one for this problem. Another discussed problem is using the self-modifying genetic programming for developing arbitrarily large sorting networks. In this case, the objective is to prove that self-modification brings new features to the cartesian genetic programming allowing the development of arbitrarily sized designs.
|
3 |
Křížení v kartézském genetickém programování / Crossover in Cartesian Genetic ProgrammingVácha, Petr January 2012 (has links)
Optimization of digital circuits still attracts much attention not only of researchers but mainly chip producers. One of new the methods for the optimization of digital circuits is cartesian genetic programming. This Master's thesis describes a new crossover operator and its implementation for cartesian genetic programming. Experimental evaluation was performed in the task of three-bit multiplier and five-bit parity circuit design.
|
4 |
Modularita v evolučním návrhu / Modularity in the Evolutionary DesignKlemšová, Jarmila January 2011 (has links)
The diploma thesis deals with the evolutionary algorithms and their application in the area of digital circuit design. In the first part, general principles of evolutionary algorithms are introduced. This part includes also the introduction of genetic algorithms and genetic programming. The next chapter describes the cartesian genetic programming and its modifications like embedded, self-modifying or multi-chromosome cartessian genetic programming. Essential part of this work consists of the design and implementation of a modularization technique for evolution circuit design. The proposed approach is evaluated using a set of standard benchmark circuits.
|
5 |
Koevoluce prediktorů fitness v kartézském genetickém programování / Coevolution of Fitness Predicotrs in Cartesian Genetic ProgrammingDrahošová, Michaela January 2017 (has links)
Kartézské genetické programován (CGP) je evoluc inspirovaná metoda strojového učen, která je primárně určená pro automatizovaný návrh programů a čslicových obvodů. CGP je úspěšné v řešen mnoha úloh z reálného světa. Avšak k nalezen inovativnch řešen obvykle potřebuje značný výpočetn výkon. Každý kandidátn program navržený pomoc CGP mus být spuštěn, aby se zjistilo, do jaké mry tento program řeš zadaný problém, a mohla mu být přiřazena fitness hodnota. Právě vyhodnocen fitness bývá výpočetně nejnáročnějš část návrhu pomoc CGP. Tato práce se zabývá využitm koevoluce prediktorů fitness v CGP za účelem zrychlen procesu evolučnho návrhu prováděného pomoc CGP. Prediktor fitness je malá podmnožina trénovacch dat použvaná pro rychlý odhad fitness hodnoty namsto náročného vyhodnocen objektivn fitness hodnoty. Koevoluce prediktorů fitness je optimalizačn metoda modelován fitness, která snižuje náročnost a frekvenci výpočtu fitness. V této práci je koevolučn algoritmus přizpůsoben pro CGP a jsou představeny a zkoumány tři přstupy k zakódován prediktorů fitness. Představená metoda je experimentálně vyhodnocena v pěti úlohách symbolické regrese a v úloze návrhu obrazových filtrů. Výsledky experimentů ukazuj, že pomoc této metody lze významně snžit výpočetn čas, který CGP potřebuje pro řešen zkoumané třdy úloh.
|
6 |
Koevoluce obrazových filtrů a detektorů šumu / Coevolution of Image Filters and Noise DetectorsKomjáthy, Gergely January 2014 (has links)
This thesis deals with image filter design using coevolutionary algorithms. It contains a description of evolutionary algorithms, focusing on genetic programming, cartesian genetic programming and coevolution, the reader can learn about image filters too. The next chapters contain the design of image filters and noise detectors using cooperative coevolution, and the implementation and testing of the proposed filter. In the last chapter the proposed filter is compared to other filters created using evolutionary algorithms but without coevolution.
|
7 |
Evoluční návrh konvolučních neuronových sítí / Evolutionary Design of Convolutional Neural NetworksPiňos, Michal January 2020 (has links)
The aim of this work is to design and implement a program for automated design of convolutional neural networks (CNN) with the use of evolutionary computing techniques. From a practical point of view, this approach reduces the requirements for the human factor in the design of CNN architectures, and thus eliminates the tedious and laborious process of manual design. This work utilizes a special form of genetic programming, called Cartesian genetic programming, which uses a graph representation for candidate solution encoding.This technique enables the user to parameterize the CNN search process and focus on architectures, that are interesting from the view of used computational units, accuracy or number of parameters. The proposed approach was tested on the standardized CIFAR-10dataset, which is often used by researchers to compare the performance of their CNNs. The performed experiments showed, that this approach has both research and practical potential and the implemented program opens up new possibilities in automated CNN design.
|
8 |
Nástroj pro analýzu záznamů o průběhu evoluce číslicového obvodu / A Tool for Analysis of Digital Circuit Evolution RecordsKapusta, Vlastimil January 2015 (has links)
This master thesis describes stochastic optimization algorithms inspired in nature that use population of individuals - evolutionary algorithms. Genetic programming and its variant - cartesian genetic programming is described in a greater detail. This thesis is further focused on the analysis and visualization of digital circuit evolution records. Existing tools for visualization of the circuit evolution were analysed, but because no suitable tool allowing complex analysis of the circuit evolution was found, a new set of functions was proposed and the principles of a new tool were formulated. These functions were implemented in form of an interactive GUI application in Java programming language. The application was described in detail and then used for analysis of digital circuit evolution records.
|
9 |
Koevoluční algoritmus pro úlohy založené na testu / Coevolutionary Algorithm for Test-Based ProblemsHulva, Jiří January 2014 (has links)
This thesis deals with the usage of coevolution in the task of symbolic regression. Symbolic regression is used for obtaining mathematical formula which approximates the measured data. It can be executed by genetic programming - a method from the category of evolutionary algorithms that is inspired by natural evolutionary processes. Coevolution works with multiple evolutionary processes that are running simultaneously and influencing each other. This work deals with the design and implementation of the application which performs symbolic regression using coevolution on test-based problems. The test set was generated by a new method, which allows to adjust its size dynamically. Functionality of the application was verified on a set of five test tasks. The results were compared with a coevolution algorithm with a fixed-sized test set. In three cases the new method needed lesser number of generations to find a solution of a desired quality, however, in most cases more data-point evaluations were required.
|
10 |
Využití regresních metod pro predikci dopravy / Regession Methods in Traffic PredictionVaňák, Tomáš January 2014 (has links)
Master thesis deals with possibilities of predicting traffic situation on the macroscopic level using data, that were recorded using traffic sensors. This sensors could be loop detectors, radar detectors or cameras. The main problem discussed in this thesis is the travel time of cars. A method for travel time prediction was designed and implemented as a part of this thesis. Data from real traffic were used to test the designed method. The first objective of this thesis is to become familiar with the prediction methods that will be used. The main objective is to use the acquired knowledge to design and to implement an aplication that will predict required traffic variables.
|
Page generated in 0.1591 seconds