Přeskočit na horní lištu
Přeskočit na hlavičku
Přeskočit na obsah
Přeskočit na patičku
EN
>
PA163 Constraint programming
Interaktivní osnova
PA163 Constraint programming
OBSAH
PA163 Constraint programming
Nyní studovat
Slides from the lectures and seminars in one file
Nyní studovat
Lectures
•
Base terminology, examples, complexity.
•
Graph representation. Arc consistency.
•
Path consistency, k-consistency.
•
Directional consistency, graph width, and polynomial CSPs. Generalized arc consistency and bound consistency.
•
Global constraints. Generalized consistency algorithm.
•
Look ahead.
•
Look back. Incomplete search I.
•
Incomplete search II. Local search
•
Constraint propagation for scheduling. Comparison of search algorithms.
•
Constraint optimization problem. Revision lesson.
Nyní studovat
Seminars
•
Introduction to OPL
•
Global constraints
•
Modeling
•
Scheduling I
•
Scheduling II
•
Search
Prohlédnout vše
Graph representation. Arc consistency.
Chyba: Odkazovaný objekt neexistuje nebo nemáte právo jej číst.
https://is.muni.cz/el/fi/podzim2024/PA163/um/2.pdf
Předchozí
Následující
PA163 Constraint programming
Nyní studovat
Slides from the lectures and seminars in one file
Nyní studovat
Lectures
•
Base terminology, examples, complexity.
•
Graph representation. Arc consistency.
•
Path consistency, k-consistency.
•
Directional consistency, graph width, and polynomial CSPs. Generalized arc consistency and bound consistency.
•
Global constraints. Generalized consistency algorithm.
•
Look ahead.
•
Look back. Incomplete search I.
•
Incomplete search II. Local search
•
Constraint propagation for scheduling. Comparison of search algorithms.
•
Constraint optimization problem. Revision lesson.
Nyní studovat
Seminars
•
Introduction to OPL
•
Global constraints
•
Modeling
•
Scheduling I
•
Scheduling II
•
Search
Operace
Prohlédnout vše