National Repository of Grey Literature 64 records found  beginprevious44 - 53nextend  jump to record: Search took 0.00 seconds. 
Implementation and testing of selected optimization methods for the parameter estimation of simulation models
Zapletal, Marek ; Matoušek, Radomil (referee) ; Grepl, Robert (advisor)
This thesis deals with design of appropriate optimization algorithms for purposes of newly developed tool Mechlab’s parameter estimation, which serves for parameter estimation of simulation models in Matlab/Simulink. Levenberg-Marquardt algorithm had been chosen among other gradient methods. On the other hand, genetic algorithm and simulated annealing had been chosen from category of soft computing techniques to be implemented. Chosen algorithms were tested on artifical problem of mechanical oscilator and also on real datasets from electronic throttle. Proposed simulated annealing worked in both cases whith sufficient results, nevertheless was time-costly. For the oscilator problem, all the algorithms provided accurate solutions, but in the case of real dataset, Levenberg-Marquardt functionality was limited, while genetic algorithm still provided excelent results.
Optimization of concrete structures using stochastic optimization methods
Slowik, Ondřej ; Pukl,, Radomír (referee) ; Novák, Drahomír (advisor)
The thesis focuses the reader on the sense of optimization and its importance for civil engineering. It outlines the principles used by some optimization methods and discusses the possibility of combination of any type of methods LHS with other optimization method. The result is a new type of optimization method named Nested LHS described in the text of the third chapter. The fifth chapter applies some of the lessons learned to solve practical optimization problem - reinforced concrete bridge solved by nonlinear finite element analysis using pseudostochastic optimization method LHS mean.
Comparison of optimization methods for perfusion parameters estimation
Kříž, Marek ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
The content of this thesis is to understand the principle of ultrasound imaging and mathematical models used to estimate perfusion parameters of concentration curves. Thesis deals with global optimization algorithms for finding parameters, an approximation of the actual data model curves. It also includes a comparison of different methods and used functions.
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
Implementation and Visualization of Classic Genetic Algorithm Using Metropolis Algorithm
Matula, Radek ; Jaroš, Jiří (referee) ; Ohlídal, Miloš (advisor)
This bachelor's thesis contains description of utilisation genetic and Metropolis algorithm to solution the Traveling Salesman Problem (TSP). Thesis describes process of development aplication POC and explains problems with adjusting parameters of algorithm.
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.
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.
Traveling Salesman Problem - Serial Methods
Štys, Jiří ; Bidlo, Michal (referee) ; Kašpárek, Tomáš (advisor)
This bachelor's thesis describes some algorithm which solves traveling salesman problem by the help of serial methods. This thesis deals with efficiency analysis and scalability of this problem.
Traveling Salesman Problem: Parallel Methods Using SMP (Threads)
Weigner, Martin ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
This thesis is focused on solving the problem of traveling salesman. At first, the problem is solved by serial access at four algorithms. There are two of them chosen and transferred to parallel access. In the end there are summarized observations about different parameters of both access. This thesis also introduces questions of programming parallel applications with threads to the reader.
Prediction of Multiple Time Series at Stock Market Trading
Palček, Peter ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
The diploma thesis comprises of a general approach used to predict the time series, their categorization, basic characteristics and basic statistical methods for their prediction. Neural networks are also mentioned and their categorization with regards to the suitability for prediction of time series. A program for the prediction of the progress of multiple time series in stock market is designed and implemented, and it's based on a model of flexible neuron tree, whose structure is optimized using immune programming and parameters using a modified version of simulated annealing or particle swarm optimization. Firstly, the program is tested on its ability to predict simple time series and then on its ability to predict multiple time series.

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