Both sides previous revision
Previous revision
Next revision
|
Previous revision
|
en:dydaktyka:krr:start2019 [2019/03/05 08:16] msl [Lectures 2019] |
en:dydaktyka:krr:start2019 [2019/06/27 15:49] (current) |
- 05-21: LOD (GJN) | - 05-21: LOD (GJN) |
- 05-28: DL (GJN) | - 05-28: DL (GJN) |
- 06-04: exam - zeroeth term | - 06-04: Wrap up and summary <del>exam - zeroeth term</del> |
- 06-11: | |
==== Useful Links ==== | ==== Useful Links ==== |
* [[http://www.hakank.org/|Hakank Links]] | * [[http://www.hakank.org/|Hakank Links]] |
| |
* Lab 1. [[en:dydaktyka:csp:intro|Constraint Programming: 101]] | * Lab 1. [[en:dydaktyka:csp:intro|Constraint Programming: 101]] |
* Labs 2 and 3.[[en:dydaktyka:csp:lab1|Constraint Programming: Basic Problems]] | * Lab 2.[[en:dydaktyka:csp:lab1|Constraint Programming: Basic Problems]] |
* Lab 4. [[en:dydaktyka:csp:lab2|Constraint Programming: Basic Techniques]] | * Lab 3. [[en:dydaktyka:csp:lab2|Constraint Programming: Basic Techniques]] |
* Lab 5. [[en:dydaktyka:csp:lab3|Constraint Programming: Search Modeling]] | * Lab 4. [[en:dydaktyka:csp:lab3|Constraint Programming: Search Modeling]] |
| * Labs 5-6. [[en:dydaktyka:csp:port_scheduling|Constraint Programming: Real Life Problem]] |
| |
== Automated Planning == | == Automated Planning == |
- [[en:dydaktyka:problog:lab2|Probabilistic Programming: Probabilistic Graphs and Decision Theory]] | - [[en:dydaktyka:problog:lab2|Probabilistic Programming: Probabilistic Graphs and Decision Theory]] |
| |
===== Projects ===== | ==== Projects ==== |
| |
| There are three projects to choose from: |
| - fox-geese-corn --- simple planning problem. |
| - gangs-wars --- problem about optimal ordering of tasks. Quite simple, but it's very difficult to find the optimal solution. |
| - production-planning --- simplified problem of scheduling production at the factory. |
| |
| All the project are available via [[https://gitlab.com/agh-krr/2018-2019|gitlab]]. |
| Instructions, how to do the projects are included in the ''README.md'' files. |
| |
FIXME | The deadline is simply last class in the semester. |
| While grading I will check: |
| - if the model is correct; |
| - if the model allows to quickly find a good solution; |
| - if the model is comprehensible; |
| - what was your work hygiene (how often did you commit, did you contact in case of a problem, etc.) |
| |