National Repository of Grey Literature 139 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
Competitions in Artificial Intelligence
Šafář, Pavel ; Hynčica, Tomáš (referee) ; Honzík, Petr (advisor)
My thesis is focused on the field of artificial intelligence and especially on the competitions in the areas of robotics, computer vision, communication, time series forecasting and game playing programmes. Furthermore I devoted myself to the research of the use of neural network as a tool to solve the Gomoku game problems. The neural network processes the game situations and sets up the output values based on the pre-set models.
Data analysis from the manufacturing process
Krčmář, Martin ; Honzík, Petr (referee) ; Zezulka, František (advisor)
This thesis deals with the classification of production data using algorithms: neural networks, decision trees and naive bayesian classifier. The neural network is dedicated forward multilayer networks with a learning algorithm of backpropagation. In thesis, these algorithms are described and evaluated their pros and cons. Another part deals with the development of the program in C# for creating these algorithms. The last part is devoted to the evaluation of the results. Bachelor thesis contains a sample of generated clasification models decision tree and bayesian classifier.
Adaptible Joystick Interpret for RDS
Erben, Vojtěch ; Burian, František (referee) ; Honzík, Petr (advisor)
The main subjects of this bachelor thesis are proposal and implementation of control adaptation on concrete user. Adaptation is achieved by proposed adaptable interpreter, which changes joystick behavior using conversion function. Parameters of the conversion function are set by evolution algorithm based on recent drive through given path. The development environment Microsoft Robotics Developer Studio (MRDS) is described in the introduction including instructions for creating a simple project. Furthermore, there is analyzed way of work with joystick and adjustments to his behavior. Follows description of way of programming in MRDS, concerning getting robot object from simulation and its automatic driving. Next part of this work describes proposal and implementation of adaptable joystick interpreter. There is proposed equation of the conversion function used in this interpreter and described the way of setting its parameters. Last part describes methods of testing and test results.
Decision trees
Patera, Jan ; Sáblík, Václav (referee) ; Honzík, Petr (advisor)
This diploma thesis presents description on several algorithms for decision trees induction and software RapidMiner. The first part of the thesis deals with partition and terminology of decision trees. There’re described all algorithms for decision tree construction in RapidMiner. The second part deals with implementation and comparison of chosen algorithms. The application was developed in C++. Based on the real datesets the comparisson of different algorithms was realized using Rapid Miner 4.0.
Robotic Soccer in RDS
Kuparowitz, Tomáš ; Florián, Tomáš (referee) ; Honzík, Petr (advisor)
The aim of this thesis is to create a list of robotic simulators suitable for simulating robotic soccer. Simulation environment included in Microsoft Robotic Developer Studio is also used to implement the vector field path planning algorithm for robotic soccer.
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
Meta-learning
Hovorka, Martin ; Hrabec, Jakub (referee) ; Honzík, Petr (advisor)
Goal of this work is to make acquaintance and study meta-learningu methods, program algorithm and compare with other machine learning methods.
Voice recognition of standard PILOT-CONTROLLER control commands
Kufa, Tomáš ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The subject of this graduation thesis is an application of speech recognition into ATC commands. The selection of methods and approaches to automatic recognition of ATC commands rises from detailed air traffic studies. By the reason that there is not any definite solution in such extensive field like speech recognition, this diploma work is focused just on speech recognizer based on comparison with templates (DTW). This recognizor is in this thesis realized and compared with freely accessible HTK system from Cambrige University based on statistic methods making use of Hidden Markov models. The usage propriety of both methods is verified by practical testing and results evaluation.
Character recognition in the soundtrack with SOM
Malásek, Jan ; Honzík, Petr (referee) ; Honzík, Petr (referee) ; Pohl, Jan (advisor)
This bachelor´s thesis describes a history of neural networks evolution and their using in speech recognition systems and shows problems with working and learning neural networks. It presents three chosen systems for speech recognition including their evaluation in experiments, their advantages and disadvantages. It is also about human speech characteristics and systems of its recognition. The last part is focused on frequency spectrums of different types of vowels and gives instructions for programming neural networks using MATLAB.
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.

National Repository of Grey Literature : 139 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.