This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
en:dydaktyka:krr:start [2018/04/10 14:56] ligeza [Lectures 2018] |
en:dydaktyka:krr:start [2018/04/19 14:42] msl [Projects] |
||
|---|---|---|---|
| Line 153: | Line 153: | ||
| - [[en:dydaktyka:problog:lab2|Probabilistic Programming: Probabilistic Graphs and Decision Theory]] | - [[en:dydaktyka:problog:lab2|Probabilistic Programming: Probabilistic Graphs and Decision Theory]] | ||
| + | ==== 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. | ||
| + | - port-scheduling --- almost real-life problem about scheduling coal deliveries in an Australian port. | ||
| + | |||
| + | All the project are available via [[https://gitlab.com/agh-krr|gitlab]]. | ||
| + | The test assignment is an obligatory project, that everyone has o finish before starting working on the one real projects. | ||
| + | Instructions, how to do the projects are included in the ''README.md'' files. | ||
| + | |||
| + | 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.) | ||
| + | |||
| + | PS yes, you can do projects in pairs. | ||
