|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
|
Genetic Algorithms and Scheduling
Škrabal, Ondřej ; Popela, Pavel (referee) ; Roupec, Jan (advisor)
This work deals with scheduling problem in particular plastic production service. The solution is based on heuristic algorithms, programming languages C + +, C # and is built on the .NET framework and LINQ to XML. It provides the users with comparisons of the heuristic approach with genetic algorithms applied to production problem. All methods results are compared in relation to hand-arranged plans.
|
|
|
Genetic Algorithms - Multi-core CPU Implementation
Studnička, Vladimír ; Kuba, Martin (referee) ; Matoušek, Radomil (advisor)
his diploma thesis deals with creating the most universal library of genetic algorithms in C++, as much as possible, implemented with the certain number of universal operators, and then with testing created library on some examples. Library must support multi-core processors, implementation will be done over OpenMP. The library will be tested on three examples in all. The first two examples are mathematical functions, that are used just for genetic algorithms testing. Last problem for test is N-Queens problem. Finally we will use genetic algorithms to try find solution for Eternity II puzzle, there is declared a 2 million bounty for full solution.
|
|
| |
|
| |
|
| |
|
|
Evolutionary algorithms
Bortel, Martin ; Karásek, Jan (referee) ; Burget, Radim (advisor)
Thesis describes main attributes and principles of Evolutionary and Genetic algorithms. Crossover, mutation and selection are described as well as termination options. There are examples of practical use of evolutionary and genetic algorithms. Optimization of distribution routes using PHP&MySQL and Google Maps API technologies.
|
|
|
Eye gaze tracking
Bastl, Petr ; Číp, Pavel (referee) ; Richter, Miloslav (advisor)
This thesis deals with the eye gaze tracking and determining the direction and the place of the view. The overview of methods for determining the view direction is provided here. The direct 3D gaze estimation technique is proposed and implemented. The eye gaze can be estimated by using a single camera and under nature head movement. This paper describes the algorithms for the image processing and the image description. The center of the pupil is determined by the genetic algorithm for the ellipse detection. The procedures of the instrumentation calibration are proposed here as well. The work also addresses the issue of the determining the eye location. Finally, the comparison of the accuracy with similar projects is mentioned in my thesis.
|
|
|
Recognition of emotions in Czech texts
Červenec, Radek ; Smékal, Zdeněk (referee) ; Burget, Radim (advisor)
With advances in information and communication technologies over the past few years, the amount of information stored in the form of electronic text documents has been rapidly growing. Since the human abilities to effectively process and analyze large amounts of information are limited, there is an increasing demand for tools enabling to automatically analyze these documents and benefit from their emotional content. These kinds of systems have extensive applications. The purpose of this work is to design and implement a system for identifying expression of emotions in Czech texts. The proposed system is based mainly on machine learning methods and therefore design and creation of a training set is described as well. The training set is eventually utilized to create a model of classifier using the SVM. For the purpose of improving classification results, additional components were integrated into the system, such as lexical database, lemmatizer or derived keyword dictionary. The thesis also presents results of text documents classification into defined emotion classes and evaluates various approaches to categorization.
|
|
| |
guest ::
