National Repository of Grey Literature 271 records found  beginprevious215 - 224nextend  jump to record: Search took 0.01 seconds. 
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
Evolutionary Design of Moving Objects
Baláž, Martin ; Žaloudek, Luděk (referee) ; Bidlo, Michal (advisor)
This thesis deals with the utilization of evolutionary techniques to find such environment characteristics, that allow the object in this environment to perform the movement according to specified parameters. The environment which is utilized in this work is a cellular automaton, whose local transition function is optimized using the genetic algorithm. The principles of computational development are applied. The presented work tends to the area of theoretical biology. Its main objective is to create a simple simulator of life of artificial organisms. In particular, movement as a specific aspect of life is considered. For this purpose the application allows the designer to define an organism at the level of cells of the cellular automaton and apply the genetic algorithm to design the transition function specifying the behavior of the organism according to given parameters.
Implementation of Mining Modules of Data Mining System on NetBeans Platform
Stríž, Rostislav ; Bartík, Vladimír (referee) ; Šebek, Michal (advisor)
Data collecting plays an important role in many aspects of today's businesses and quality information is the key to success. Process called Knowledge Discovery in Databases makes possible to extract hidden information that can be used further in our efforts. Main goal of this thesis is to describe an addition to such Data Mining System. Main objective is to create data mining module for NetBeans application, developed for demonstrational purposes by Faculty of Information Technology. New module is going to be able to mine information from Oracle database server via unusual use of Genetic Algorithm. This thesis describes the whole process of module implementation, begining with theoretical basics through coding details to final testing and summary.
Evolutionary Design of Neural Networks
Beluský, Tomáš ; Vašíček, Zdeněk (referee) ; Minařík, Miloš (advisor)
The work deals with the development of the genetic algorithm, which designs the structure and learning of the neural networks. The fitness function also includes the number of hidden neurons, and thus we obtain the most optimal structure, which is reachable. The own versions of the operators are presented, which manage the entire process of evolution. The result of the work is a library for evolutionary design of neural networks. Moreover, graphical interface for setting parameters and displaying the results was created. In the experimental part the design is compared with other systems and algorithms. Finally, results are reviewed and the process for the following development of the system is outlined.
Optimization Methods for SIMLIB/C++
Godula, Martin ; Martinek, David (referee) ; Peringer, Petr (advisor)
Bachelor's thesis is concerned with methods for global optimization. It deals with concept of optimization theoretically, and describes its goals and chosen optimization methods, suggests process of their implementation with regard to compatibility with simulation library SIMLIB/C++. It describes their implementation in C++ language and demostrates their functionality on different test problems and evaluates their rate of success.
Discovery of Wireless Sensor Network Topology Using Genetic Algorithms
Dalecký, Štěpán ; Samek, Jan (referee) ; Zbořil, František (advisor)
The thesis deals with a design of the genetic algorithm that is able to discover the wireless sensor network topology using signal strength among particular sensors. At first, the thesis describes the theory of genetic algorithm and wireless sensor network. Subsequently, on the basis of this theory, the genetic algorithm serving for the wireless sensor network topology discovery has been designed. The thesis also describes important features of the algorithm implementation. In conclusion, the outcomes have been reviewed.
Comparison of Programs for Scheduling
Kubalcová, Monika ; Martinek, David (referee) ; Křena, Bohuslav (advisor)
This thesis deals with timetabling issues at the Faculty of Information Technology, Brno University of Technology. It focuses mainly on scheduling of lectures and exams for students. In first part, the current situation, restrictive conditions and actual procedure are described. Afterwards, theoretical aspects of scheduling problem are discussed. In the second part of the thesis, selected software application for automatic generation of timetables are compared. The most suitable application is then evaluated by producing a real timetable. The achieved results are discussed and the future directions are suggested in the conclusion.
Application for Generating of School Schedules
Fiala, Jan ; Horáček, Jan (referee) ; Rozman, Jaroslav (advisor)
This work deals with problem of generating school schedules. The solution is based on three heuristic algorithms (hill-climbing, simulated annealing, genetic algorithm) and is fully implemented in JAVA. It provides a comparison of implemented heuristic algorithms including description of their pros and cons.
Prediction of the Secondary Structure of Proteins by Cellular Automaton
Šalanda, Vojtěch ; Vogel, Ivan (referee) ; Bendl, Jaroslav (advisor)
This thesis presents a new approach to the prediction of the secondary structure of proteins. It employs a new method based on cellular automata and its characteristic properties. The main objective is to increase speed of the prediction even at the cost of slight decrease of overall accuracy. Optimal parameters of cellular automata was found by genetic algorithm using suitable genetic operators. These parameters are incorporated into developed application for prediction. Finally, the results was compared with results of other tools for this purpose.
Digital Filter Design on GPU
Vaverka, Filip ; Maršík, Lukáš (referee) ; Polok, Lukáš (advisor)
This thesis shows one of the approaches to the design of ditigal filters with infinite impulse response and specified order. The proposed solution is based on an evolutionary genetic algorithm and therefore allows for direct filter design from its specification. Its main contribution to this subject is that the implementation is parallel and it is acceleraded by GPU. The filters are designed in cascade representation. It also allows to specify both, the desired frequency and phase characteristics of filters.

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