National Repository of Grey Literature 3 records found  Search took 0.02 seconds. 
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.
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.
Using the method of least squares in economic applications
JANEČKOVÁ, Zuzana
The aim of bachelor thesis is the description and the theoretical deduction of the method of least squares. In my work I attend to the deduction of least-squares with an exclusive focus on polynomial functions. This method is applied to the indicators of foreign trade, specifically turnover, exports, imports and balance. I gradually attend to polynomial of the first, the second to the m-th power. The objective of least-squares method assumes that the best-fit curve of a given type is the curve that has the minimal sum of the deviations squared.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.