|
| |
|
| |
|
|
Procedural Generation and Simulation of 2D Gaming World
Dubský, Tomáš ; Kocur, Viktor (referee) ; Chlubna, Tomáš (advisor)
Cílem práce je implementace procedurálního generování a simulace dvojdimenzionálního herního světa. Herní svět je tvořen nekonečnou mřížkou malých dlaždic. Tyto dlaždice jsou seskupeny do částí, takže svět je generován a simulován pouze pro ty části, které jsou poblíž hráče. Generovaný terén se skládá z několika biomů a podzemních jeskyní. Kapaliny, plyny nebo třeba růst trávy patří mezi procesy, které jsou simulovány.
|
|
|
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.
|
|
|
Interactive simulation by means of Flash technology
Látal, Pavel ; Šedá, Jitka (referee) ; Matoušek, Radomil (advisor)
This bachelor thesis is interested in designing of six interactive simulations by means of Flash technology. The presented interactive simulations are follows: an extended version of Conway’s cellular automata which was realized on orthogonal and hexagonal grid, simulation of 1D cellular automata, demonstration of selected selection principles of evolutionary algorithms, possible graphic representation of 2D Turing machine, and application for demonstration of ant colony behavior.
|
|
|
Representation Techniques for Evolutionary Design of Cellular Automata
Kovács, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this thesis is to experimentally evaluate the performance of several distinct representations of transition functions for cellular automata. Cellular automata have many potential applications for simulating various phenomena (e.g. natural processes, physical systems, etc.). Parallel computation of cellular automata is based on local cell interactions. Such computation, however, may prove difficult to program the CA, which is the reason for applying evolutionary techniques for the design of cellular automata in many cases. Evolutionary algorithms, based on Darwin's theory of evolution, have been used to find human-competitive solutions to many problems. In order to perform the evolutionary design of cellular automata, special encodings of the candidate solutions are often necessary. For this purpose the performance testing of various representations of the transition functions will be investigated. In particular, table representation, conditionally matching rules, and genetic programming will be treated. The problem of square calculations in cellular automata will be considered as a case study.
|
|
|
Game in a Shader
Ivanecký, Ján ; Milet, Tomáš (referee) ; Polok, Lukáš (advisor)
This thesis deals with design and implementation of a simple strategic game using OpenGL, whose game logic is realized by the graphics card and rendering is realized by the graphics card in one shader. It also contains introduction to OpenGL, overview of techniques used for generating procedural textures and overview of rendering methods based on Ray Casting.
|
|
|
Cellular Automata Design Optimization
Jílek, Tomáš ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization. There are described Evolutionary algorithms and Cellular automata in first part. Thereafter, one of the new ways of transition function representation and its possible evolutionary design is presented. Name of this method is Conditionally Matching Rules. This is followed by description of realized experiments with detailed results. Finally, success with optimalization for some tasks is presented in last chapter along with discussion.
|
|
|
Artificial Life Simulator
Popek, Miloš ; Grulich, Lukáš (referee) ; Martinek, David (advisor)
Area of artificial life is very extensive. Simulations with reactive agents are the target of this work. Simulator of artificial life and language for definition agent's behavior are described in this work. Porposals a results of simulation made are described in this work.
|
|
|
Artificial life
Weigl, František ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This bachelor thesis deals with the issue of artificial life. The first part provides a brief overview of the history of artificial life and the current division of artificial life. The second part describes some important software models of artificial life. The last part of the work contains simple experiments with a cellular automaton.
|
guest ::
