|
|
MCTS for the game Metro
Venta, Václav ; Hric, Jan (advisor) ; Babka, Martin (referee)
MCTS method was first introduced in 2006 and it immediately succeeded in the game of GO. Its biggest advantage is that it doesn't require any evaluation function, which is often hard to design in a lot of games. Instead it is based on randomized simulations. This thesis describes MCTS principles and deals with its suitability for the board game Metro. The text describes Metro characteristics which make the game suitable for the use of MCTS. A software serving as game environment is attached to this work on CD. It has artificial intelligence based on MCTS method implemented in it. Powered by TCPDF (www.tcpdf.org)
|
|
|
General card game with user-defined rules
Bilanský, Michal ; Babka, Martin (advisor) ; Marek, Lukáš (referee)
The goal of this thesis is to design and implement a generic card game for multiple users. The rules of the game are defined by user using an available set of rules and commands. The game is playable on the network and also includes a simple artificial intelligence allowing to replace a human factor by the computer. The program is created for .NET on Windows platform in the programming language C#. Powered by TCPDF (www.tcpdf.org)
|
|
|
Editor's office workflow management system
Pospíšil, Martin ; Kopecký, Michal (advisor) ; Babka, Martin (referee)
Title: Editor's office workflow management system Author: Martin Pospisil Department: The Department of Software Engineering Supervisor: RNDr. Michal Kopecky, Ph.D., The Department of Software Engineering Abstract: The goal of this bachelor thesis is to analyze and implement an editorial system that supports the process management in a company which operates and administrates several web portals aimed to health care and medical science. The goal is to make the work within the company more effective a make the process management more transparent to decrease the amount of work that must be performed manually. It should lead to reducing the costs. The system ensures a complete evidence and management of the process of creating and publishing articles. Consequently it allows to automatically generate work reports which serve as the records for paying the editorial's office staff.
|
|
| |
|
|
Self-organizing linear lists
Kulman, Igor ; Koubková, Alena (advisor) ; Babka, Martin (referee)
Self-organizing linear lists Self-organizing linear lists are data structures for fast search, provided that certain elements stored in them are searched more frequently than others, while the probability of access to individual elements is generally not known in advance. Efficient search is achieved using different permutation rules that keep changing the list structure so that the more frequently searched elements are closer to the beginning. This thesis gives an overview of known algorithms for solving this problem (with the theoretical results about their complexity, if they are known), and experimental study of their behavior (using its own or freely available implementations and software for generating input data, testing algorithms and processing the results of experiments).
|
|
|
Unified Editor for CEGUI
Preisler, Martin ; Babka, Martin (advisor) ; Balyo, Tomáš (referee)
This thesis presents a free software GUI application called the CEGUI Unified Editor. The application is mainly written in Python and is licensed under GPLv3. Its purpose is to create and modify assets of graphical interfaces made with the CEGUI library. Features include project management, imageset editing and layout editing. Data for older versions of CEGUI are transparently converted using compatibility layers. Big emphasis is put on ease of use, collaboration between multiple content authors and portability.
|
|
|
2D Platform Game Creator
Rybář, Milan ; Balyo, Tomáš (advisor) ; Babka, Martin (referee)
The aim of this thesis is to implement an application for creating 2D games with physics simulation. The game can be created without any programming knowledge. We propose an extendable visual scripting to define the behaviour of game objects. The game objects are described by finite state machines. Nodes with pre-defined behaviour are connected on a virtual space at the object states. The work contains a comparison with similar applications. The capabilities of the application and the visual scripting method are demonstrated on a sample project.
|
|
|
Automatization of hierarchical experiments
Babka, Martin ; Kopecký, Michal (referee) ; Skopal, Tomáš (advisor)
The aim of this work is to design and implement an application needed to create hierarchic experiments. The exact definition and purpose of hierarchic experiments are analysed in this work. The principle of hierarchic experiments is then used to implement a framework for white box software testing. It should by utilized mainly for benchmarking tests. The tested code must be in the C or C++ languages since the framework is developed in C++. Output of the application is a C++ source code that tests the user's algorithm in the selected manner. The application also outputs the needed makefiles and uses visual editing to create the testing set. It is also capable of simple processing of the collected performance data.
|
|
|
Vlastnosti universálního hašování
Babka, Martin ; Majerech, Vladan (referee) ; Koubek, Václav (advisor)
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. The model is based on the idea of universal hashing and the expected time of every operation is constant. The used universal class of functions consists of linear transformations between vector spaces. This class has already been studied with a good asymptotic result. This work improves the result and proves that the expected amortised time of the scheme is constant.
|
|
| |
guest ::
RSS feed.