This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
en:dydaktyka:krr:start2019 [2019/02/24 13:04] gjn created |
en:dydaktyka:krr:start2019 [2019/06/27 15:49] (current) |
||
|---|---|---|---|
| Line 6: | Line 6: | ||
| ===== Lectures 2019 ===== | ===== Lectures 2019 ===== | ||
| - | - 02-26: | + | - 02-26: CSP (MSL) |
| - | - 03-05: | + | - 03-05: CSP (MSL) |
| - | - 03-12: | + | - 03-12: CSP (MSL) |
| - | - 03-19: | + | - 03-19: CSP (MSL) |
| - | - 03-26: | + | - 03-26: KRR introduction (GJN) |
| - | - 04-02: | + | - 04-02: LPP (GJN) |
| - | - 04-09: | + | - 04-09: Planning (MSL) |
| - | - 04-16: | + | - 04-16: Problog (MSL) |
| - | - 05-07: | + | - 05-07: KR methods overview (GJN) |
| - | - 05-14: | + | - 05-14: RBS (GJN) |
| - | - 05-21: | + | - 05-21: LOD (GJN) |
| - | - 05-28: | + | - 05-28: DL (GJN) |
| - | - 06-04: | + | - 06-04: Wrap up and summary <del>exam - zeroeth term</del> |
| - | - 06-11: | + | |
| - | + | ||
| - | CSP (MSL) x4 | + | |
| - | Planning (MSL) | + | |
| - | Problog (MSL) | + | |
| - | + | ||
| - | KRR introduction (GJN) | + | |
| - | LPP (GJN) | + | |
| - | KR methods overview (GJN) | + | |
| - | RBS (GJN) | + | |
| - | LOD (GJN) | + | |
| - | DL (GJN) | + | |
| - | + | ||
| - | exam - zeroeth term | + | |
| ==== Useful Links ==== | ==== Useful Links ==== | ||
| Line 61: | Line 47: | ||
| * 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 == | ||
| Line 81: | Line 68: | ||
| - [[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.) | ||
