|
| |
|
| |
|
| |
|
|
Algorithms for solving of special knapsack problems and their computational complexity
Sem, Štěpán ; Ivánek, Jiří (advisor) ; Kalčevová, Jana (referee)
The thesis deals with knapsack problems variants and possibility of their solving, furthermore with the impact of particular task (instance) special structure on the effciency of tested approach. The thesis also proposes conversion possibility between described tasks and their continuous extension (continuous relaxation). It describes L3 algorithm and superdecreasing knapsack problem solving from the common sort of algorithms and Monte Carlo Method, simulated annealing and genetic algorithms from the sort of probability ones. Other possibilities are also discussed. Integral part of this thesis is the accompanying application, which was used to create groundwork used in the text and which can be also used to solve other instances.
|
|
|
Program walkthough simulation through flowchart for teaching algorithms
BARTYZAL, Miroslav
The work is concerned with development of application for fast and efficient way of assembling algorithms using flowcharts and their subsequent walkthrough visualization for purpose of teaching algorithms. First part of the work consists of basic terminology description, which describes in particular the different flowchart symbols. Other parts of the work are devoted to the analysis of the treated subject, application design and interesting sections of development. The last part of the thesis summarizes the verification of the application in practice and the results of this work.
|
|
| |
|
| |
|
|
Polynomial-time Algorithm for Basic Troubleshooting with Call-Service
Lín, Václav
In decision-theoretic troubleshooting, we are given a probabilistic model of a man-made device. Our task is to identify and eliminate a fault causing the device to malfunction through a sequence of troubleshooting actions. We study a variant of the problem where we can at any time “call service” and eliminate the fault at once by paying a fixed penalty.
|
|
| |
|
|
Network flows and their software support
Zdražil, Jan ; Sekničková, Jana (advisor) ; Chlapek, Dušan (referee)
This thesis deals with the maximum flow problem in network. First part describes and explains basic terms of graph theory, which gives theoretical base for following text. Next part is dedicated to algorithms that may be used to solve a maximum flow problem. Each described algorithm contains a brief history, general notation and a practical example. The next very important part of the thesis is in specific computer science applications such as computer vision and web mining. As an essential part of the thesis is developed software in programming language Java, which allows user to compare the implemented algorithms and to solve large network flows problems.
|
guest ::
