|
|
Congruences for Tree Automata
Žufan, Petr ; Janků, Petr (referee) ; Holík, Lukáš (advisor)
This thesis discusses testing of tree automata (TA) equivalence. We propose a new algorithm based on Bonchi Pouse's algorithm of word automata. The new algortihm combines bisimulation and determinization on the fly. Using an optimalization based on congruence closure, we try to avoid extreme expansion of state space. From this point of view, the new algorithm is better than others.
|
|
|
Application of Evolutionary Algorithms in Quantum Computing
Žufan, Petr ; Mrázek, Vojtěch (referee) ; Bidlo, Michal (advisor)
In this thesis, an evolutionary system for searching quantum operators in the form of unitary matrices is implemented. The aim is to propose several representations of candidate solutions and settings of the evolutionary algorithm. Two evolutionary algorithms were applied: the genetic algorithm and evolutionary strategy. Furthermore, a method of generating a unitary matrix is presented which is used for the first time for this task. This method is in some aspects better than the previous ones. Finally, a comparison of all used techniques is shown in experiments.
|
|
|
Application of Evolutionary Algorithms in Quantum Computing
Žufan, Petr ; Mrázek, Vojtěch (referee) ; Bidlo, Michal (advisor)
In this thesis, an evolutionary system for searching quantum operators in the form of unitary matrices is implemented. The aim is to propose several representations of candidate solutions and settings of the evolutionary algorithm. Two evolutionary algorithms were applied: the genetic algorithm and evolutionary strategy. Furthermore, a method of generating a unitary matrix is presented which is used for the first time for this task. This method is in some aspects better than the previous ones. Finally, a comparison of all used techniques is shown in experiments.
|
|
|
Congruences for Tree Automata
Žufan, Petr ; Janků, Petr (referee) ; Holík, Lukáš (advisor)
This thesis discusses testing of tree automata (TA) equivalence. We propose a new algorithm based on Bonchi Pouse's algorithm of word automata. The new algortihm combines bisimulation and determinization on the fly. Using an optimalization based on congruence closure, we try to avoid extreme expansion of state space. From this point of view, the new algorithm is better than others.
|
|
|
Potential of less-favored areas for cultivated biomass production in Czechia
Holub, Vít ; Jančák, Vít (advisor) ; Žufan, Petr (referee)
The main goal of this work is to analyse possibilities of growing biomass in less-favoured areas (LFA) in Czechia. This work evaluates existing development and potentialities trends in using biomass and less-favoured areas at first. In this tendency is raising interest of European union (EU) and Czechie for renewable energy source noticeable. For czech situation is the biomass (and within this energyplant of second generation) the best variation. Using for heatproduction is the best variant of this crop. In the case of LFA is using dotation for grassing in the EU and since 1989 in Czechia too. The Grassing is natural process, becouse of a low economic rentability, but there are another variants of using this places. LFA like a localities for rising the fast-growing trees is one of these variants. This work mentions rising fast-growing trees on a half part of LFA. The benefits of this potential situation are in good ecology of region and in many social factors too. But with regard to variablity LFA (especially in sociogeographical sphere) it is impossible to mark exactly good region for founding a fast-growing trees plantation. It is already a question for further case studies. 9
|
guest ::
RSS feed.