|
|
Filtering Algorithms for Tabular Constraints
Molnár, Martin ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The thesis studies an implementation of arc-consistency filtering algorithms for constraints defined in extension. We propose a new concept of binarization for decomposing high-arity ad-hoc constraints into networks of binary constraints. A theory proving correctness of the binarization is developed. We study the existing algorithms from the perspective of our binarization concept and propose possible binarization schemes for ad-hoc constraints defined in some of the common forms. In the thesis we also propose the filtering algorithms for the elementary constraints. A compound propagator then uses the elementary constraint filtering algorithms to propagate over the high-arity constraint. Finally, we experimentally evaluate the proposed approaches on constraints generated when solving the planning problems.
|
|
|
Object-oriented Command Shell
Molnár, Martin ; Ježek, Pavel (advisor) ; Šerý, Ondřej (referee)
The goal of the proposed work is to explore possibilities of enriching command line interpreter programming by an object oriented approach. Author studies options of harmonizing concepts of the OOP and the batch processing and designs appropriate compromise between these two concepts. The main goal of the work is to create an implementation of the chosen design in the Unix and Microsoft Windows operating system families. This work describes decisions during the implementation and also include user manual of the resulting application.
|
|
|
Object-oriented Command Shell
Molnár, Martin ; Ježek, Pavel (advisor) ; Kofroň, Jan (referee)
The goal of the proposed work is to explore possibilities of enriching command line interpreter programming by an object oriented approach. Author studies options of harmonizing concepts of the OOP and the batch processing and designs appropriate compromise between these two concepts. The main goal of the work is to create an implementation of the chosen design in the Unix and Microsoft Windows operating system families. This work describes decisions during the implementation and also include user manual of the resulting application. Powered by TCPDF (www.tcpdf.org)
|
|
|
Filtering Algorithms for Tabular Constraints
Molnár, Martin ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The thesis studies an implementation of arc-consistency filtering algorithms for constraints defined in extension. We propose a new concept of binarization for decomposing high-arity ad-hoc constraints into networks of binary constraints. A theory proving correctness of the binarization is developed. We study the existing algorithms from the perspective of our binarization concept and propose possible binarization schemes for ad-hoc constraints defined in some of the common forms. In the thesis we also propose the filtering algorithms for the elementary constraints. A compound propagator then uses the elementary constraint filtering algorithms to propagate over the high-arity constraint. Finally, we experimentally evaluate the proposed approaches on constraints generated when solving the planning problems.
|
|
|
Object-oriented Command Shell
Molnár, Martin ; Šerý, Ondřej (referee) ; Ježek, Pavel (advisor)
The goal of the proposed work is to explore possibilities of enriching command line interpreter programming by an object oriented approach. Author studies options of harmonizing concepts of the OOP and the batch processing and designs appropriate compromise between these two concepts. The main goal of the work is to create an implementation of the chosen design in the Unix and Microsoft Windows operating system families. This work describes decisions during the implementation and also include user manual of the resulting application.
|
guest ::
RSS feed.