|
|
Bloom Filters and Their Properties
Prokop, Tomáš ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
A dissertation is engaged in a description and a construction of the Bloom filter. The inventor of this filter is Burton H. Bloom. The Bloom filter represents an efficient tool for storing elements into the universal aggregate in the form of a data structure. It processes large volume of data while filling less of store space. The data structure makes it possible to insert elements and their time after time selecting in the aggregate with zero probability of errors. Part of the dissertation is explanation of properties and usage methods of the data structure including possibility of a reduction acceptable errors. An expansion of the Bloom filter is computed Bloom filter, which allows broader usage of the data structure.
|
|
|
Arimaa
Kanis, Martin ; Škoda, Petr (referee) ; Smrž, Pavel (advisor)
Arimaa is a board game with simple rules. It is simple for human but at the same time difficult for computers. The aim of this bachelor thesis is to familiarize with game playing methods with features of the artificial intelligence. The next aim is to design and implement the program, that would be able to play against others players and programs. The most important features of the program are move generation, search and evaluation of positions. At the end, the program was tested on the game server, where played against others programs.
|
|
|
Arimaa
Kanis, Martin ; Škoda, Petr (referee) ; Smrž, Pavel (advisor)
Arimaa is a board game with simple rules. It is simple for human but at the same time difficult for computers. The aim of this bachelor thesis is to familiarize with game playing methods with features of the artificial intelligence. The next aim is to design and implement the program, that would be able to play against others players and programs. The most important features of the program are move generation, search and evaluation of positions. At the end, the program was tested on the game server, where played against others programs.
|
|
|
Bloom Filters and Their Properties
Prokop, Tomáš ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
A dissertation is engaged in a description and a construction of the Bloom filter. The inventor of this filter is Burton H. Bloom. The Bloom filter represents an efficient tool for storing elements into the universal aggregate in the form of a data structure. It processes large volume of data while filling less of store space. The data structure makes it possible to insert elements and their time after time selecting in the aggregate with zero probability of errors. Part of the dissertation is explanation of properties and usage methods of the data structure including possibility of a reduction acceptable errors. An expansion of the Bloom filter is computed Bloom filter, which allows broader usage of the data structure.
|
guest ::
