public:t-622-arti-16-1:main
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| public:t-622-arti-16-1:main [2016/01/12 15:28] – created stephan | public:t-622-arti-16-1:main [2024/04/29 13:33] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 27: | Line 27: | ||
| You complete two programming assignments. This can be done as a group project (up to 4 people, ideally 2-3). Make sure you clearly indicate who is part of the group and that every group member clearly understands the solution. | You complete two programming assignments. This can be done as a group project (up to 4 people, ideally 2-3). Make sure you clearly indicate who is part of the group and that every group member clearly understands the solution. | ||
| - | /* The [[public: | + | The first programming assignment is to use search to find a good solution for a vacuum cleaning robot. |
| - | The [[public: | + | |
| - | */ | + | The [[public: |
| ==== Project (20%) ==== | ==== Project (20%) ==== | ||
| Line 60: | Line 60: | ||
| |:::|Jan 21| 3|Blind Search, Heuristic Search | |:::|Jan 21| 3|Blind Search, Heuristic Search | ||
| | 3|Jan 26| 3|Heuristic Search | | 3|Jan 26| 3|Heuristic Search | ||
| - | |:::|Jan 27| Lab|[[Programming Assignment 1 - Search]] | | + | |:::|Jan 27| Lab|Programming Assignment 1 - Search |
| - | |:::|Jan 28| | + | |:::|Jan 28| |
| - | | 4|Feb 02| 5,6|Adversarial Search (Algorithms), CSPs | | + | | 4|Feb 02| 5|Heuristic Search, |
| - | |:::|Feb 03| Lab|[[Programming Assignment 1 - Search]] | | + | |:::|Feb 03| Lab|Programming Assignment 1 - Search |
| - | |:::|Feb 04| 6|CSPs | + | |:::|Feb 04| 6|Adversarial Search (Algorithms), |
| - | | 5|Feb 09| 7|Propositional Logic | | + | | 5|Feb 09| 7|CSPs | |
| |:::|Feb 10| Lab|[[Lab 3 - CSPs]] | |:::|Feb 10| Lab|[[Lab 3 - CSPs]] | ||
| - | |:::|Feb 11| 7|Propositional Logic, Logical Agents | + | |:::|Feb 11| 7|CSPs, Propositional Logic | |
| - | | 6|Feb 16| 7, | + | | 6|Feb 16| 7, |
| - | |:::|Feb 17| Lab|[[Programming Assignment 2 - Connect 4]] | | + | |:::|Feb 17| Lab|[[Programming Assignment 2 - Breakthrough]] | |
| - | |:::|Feb 18| 8,9,10|First Order Logic, Planning | + | |:::|Feb 18| 8,9|First Order Logic | |
| - | | 7|Feb 23| 10|Planning | + | | 7|Feb 23| 8,9|First Order Logic | |
| |:::|Feb 24| Lab|[[Lab 4 - Propositional Logic]] | |:::|Feb 24| Lab|[[Lab 4 - Propositional Logic]] | ||
| - | |:::|Feb 25| 13, 14|Uncertainty, | + | |:::|Feb 25| 10|Planning |
| - | | 8|Mar 01| 13, 14|Bayesian Networks | + | | 8|Mar 01| 10|Planning |
| - | |:::|Mar 02| Lab|[[Lab 5 - Bayesian Networks]] | | + | |:::|Mar 02| Lab|[[public:t-622-arti-16-1: |
| - | |:::|Mar 03| 18-21|Machine Learning | + | |:::|Mar 03| 13, 14|Uncertainty, |
| - | | 9|Mar 08| | + | | 9|Mar 08| 18-21|Bayesian Networks, Machine |
| - | |:::|Mar 09| Lab|Programming Assignment 2 - Competition | + | |:::|Mar 09| Lab|[[Lab 5 - Bayesian Networks]] |
| - | |:::|Mar 10| 25|Robotics | + | |:::|Mar 10| 18-21|Machine Learning |
| - | | 10|Mar 15| 15|Probabilistic Reasoning over Time | | + | | 10|Mar 15| 18-21|Learning Decision Trees | |
| |:::|Mar 16| Lab|[[Lab 6 - Learning Decision Trees]] | |:::|Mar 16| Lab|[[Lab 6 - Learning Decision Trees]] | ||
| - | |:::|Mar 17| 15|Probabilistic Reasoning over Time | | + | |:::|Mar 17| 25|Robotics |
| - | | 11|Mar 22| | + | | 11|Mar 22| 15|Probabilistic Reasoning over Time | |
| - | |::: | + | |:::| |
| - | |:::|Mar 24| | + | | 12|Mar 30| Lab|[[Lab 7 - Particle Filtering]] |
| - | | 12|Mar 29| | + | |:::|Mar 31| |Wrap-Up |
| - | |:::|Mar 30| Lab|??? | + | | 13|Apr 05| |Project Presentations |
| - | |:::|Mar 31| |??? | | + | |
| - | | 13|Apr 05| |Wrap-Up | + | |
| |:::|Apr 06| Lab|Project Presentations | |:::|Apr 06| Lab|Project Presentations | ||
| |:::|Apr 07| | |:::|Apr 07| | ||
| ^^^^^ | ^^^^^ | ||
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-16-1/main.1452612520.txt.gz · Last modified: 2024/04/29 13:32 (external edit)