11 |
Evoluční algoritmy v úloze booleovské splnitelnosti / Evolutionary Algorithms in the Task of Boolean SatisfiabilitySerédi, Silvester January 2013 (has links)
The goal of this Master's Thesis is finding a SAT solving heuristic by the application of an evolutionary algorithm. This thesis surveys various approaches used in SAT solving and some variants of evolutionary algorithms that are relevant to this topic. Afterwards the implementation of a linear genetic programming system that searches for a suitable heuristic for SAT problem instances is described, together with the implementation of a custom SAT solver which expoloits the output of the genetic program. Finally, the achieved results are summarized.
|
12 |
Redukce nedeterministických konečných automatů / Reduction of the Nondeterministic Finite AutomataProcházka, Lukáš January 2011 (has links)
Nondeterministic finite automaton is an important tool, which is used to process strings in many different areas of programming. It is important to try to reduce its size for increasing programs' effectiveness. However, this problem is computationally hard, so we need to search for new techniques. Basics of finite automata are described in this work. Some methods for their reduction are then introduced. Usable reduction algorithms are described in greater detail. Then they are implemented and tested. The test results are finally evaluated.
|
Page generated in 0.043 seconds