Server pro podporu výuky ARUO
Loading...
Downloads
2
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
The goal of the thesis is to study algorithms solving problems in a field of contrained conditions and to develop an application to demonstrate their processing and progression. The application will allow user to enter his own specification of the problem, choose an algorith to solve it and to display the process of the algorithm. Result is displayed as an animation of browsing of a tree structure representing the space of potential solutions. Thesis is dedicated to the backtracking and its modifications. Application implements basic backtracking, backjumping, forward-chacking and arc-consistency algorithms.It is ased on web technologies as HTML 5, CSS 3 and JavaScript. Application will be deployed on university server. It is accessible to the students of ARUO for studying and better understanding of the selected algorithms and to demonstrate differences among them.
Description
Subject(s)
Backtracking, backmarking, forward-checking, Arc-consistency, backjumping, learning algorithm, graph based learning, look-ahead algorithm, look-back algorithm, variable, domain, constraint, constraint network, minimal network, dead-end, forward phase, backward phase, conflict set.