No description available.

This thesis focuses on the project and realization of the implementation of the algorithm A*. The created result is used in animated graphic and interactive demonstration of the qualities A*, The other algorithms and the comparison of their functioning, results and efficacy are also part of the thesis. In the end, the results are evaluated.

No description available.

The thesis is concerned with problems of algorithm development and programming on primary schools. The main target of the whole thesis is the project of new programming conception, which should bring better results on the field of programming and more effective way of teaching. In theoretic part there are introduced the most important terms from the field of algorithm development and programming, analysis of Czech and foreign education systems, mapping of possibilities of support of teaching from technological and didactical viewpoint. The new programming conception is suggested from theoretical bases. That conception is verified by approximately half-year action research at teaching of programming on 2nd level of primary school. In conclusion of the thesis there are introduced experiences, plusses and minuses of new conception of programming teaching.

This work is focused on advanced methods of mobile robot's path planning. The theoretical part describes selected graphical methods, which are useful for speeding up the process of finding the shortest paths, for example through reduction of explored nodes of the state space. In the practical part was created simulate environment in the Python language and in this environment, selected algorithms was implemented.

Title: Multiple sequence alignment using genetic algorithms Author: Zdeněk Pátek Department: Department of Software and Computer Science Education Supervisor: RNDr. František Mráz, CSc. Abstract: The thesis adresses the problem of multiple sequence alignment (MSA). It contains the specication of the proposed method MSAMS that allows to find motifs in biological sequences, to split sequences to blocks using the motifs, to solve MSA on the blocks and nally to assemble the global alignment from the aligned blocks and motifs. Motif search and MSA are both solved using genetic algorithms. The thesis describes the implementation of the method, conguration of its settings, benchmarking on the BAliBASE database and comparison to the ClustalW program. Experimental results showed that MSAMS can discover better alignments than ClustalW. Keywords: multiple sequence alignment, motif nding, genetic algorithms, ClustalW

The topic of this thesis is digital methods in process of architectonic designing, analysis, research and application of new methods. This thesis describes theoretical sources, which are useful for creating new digital methods. Thesis systematically describes existing methods and analyzes application on various projects. In thesis is also described research of new, own methods and preview of application.

This diploma thesis deals with packet classification in computer networks. The problem of packet classification is described, together with requirements for classification algorithm. Then, necessary theoretical background is introduced. Contemporary approaches to the classification are described, together with the critique of the current state of the field. The main focus of the work is the new algorithm of packet classification based on problem decomposition. Unique property of the algorithm is constant time complexity in terms of external memory accesses. Algorithm implemetation is proposed, using FPGA and one external memory. Planned prototype may achieve throughput of 64 Gbit/s in the worst case.

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.

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.