public:t-622-arti-13-1:main
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| public:t-622-arti-13-1:main [2013/02/01 08:35] – stephan | public:t-622-arti-13-1:main [2024/04/29 13:33] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 35: | Line 35: | ||
| The [[public: | The [[public: | ||
| - | /*The [[public: | + | The [[public: |
| - | */ | + | |
| - | ==== Final Project (25%) ==== | ||
| - | You can choose a topic for the final programming project (discuss topics and find a group in the [[http:// | ||
| - | You have to hand in a 1-2 page description of the project goal and some ideas on how to achieve it in week 8 (5% of the final grade) and a report and demonstration in week 12 (15% of the final grade). | ||
| + | ==== T-622-ARTI. Spring 2013 - Final Project (25%) ==== | ||
| + | You can choose a topic for the final programming project (discuss topics and find a group in the [[http:// | ||
| + | You have to hand in a 1-2 page description of the project goal and some ideas on how to achieve it approx. in week 8 (5% of the final grade) and a report and demonstration in week 12 (20% of the final grade). | ||
| - | /* | + | [[public:t-622-arti-13-1: |
| - | Project topics: | + | |
| - | */ | + | ==== Exam (40%) ==== |
| + | There will be a final exam (3h) with questions similar to the ones in the assignments. | ||
| ===== Course Schedule (subject to change) ===== | ===== Course Schedule (subject to change) ===== | ||
| Line 59: | Line 59: | ||
| |:::|Jan 31| Lab|[[Lab 2 - Formulating Search Problems]] | |:::|Jan 31| Lab|[[Lab 2 - Formulating Search Problems]] | ||
| |:::|Feb 01| 3|Heuristic Search | |:::|Feb 01| 3|Heuristic Search | ||
| - | | 4|Feb 04| 5|Adversarial Search(Minimax) | + | | 4|Feb 04| 5|Adversarial Search (Minimax, Alpha-Beta) | |
| - | |:::|Feb 07| Lab|? | | + | |:::|Feb 07| Lab|[[Lab 3 - Hashing States]] |
| - | |:::|Feb 08| 5|Adversarial Search(Iterative Deepening, TT) | | + | |:::|Feb 08| 5|Adversarial Search (Algorithms) | |
| | 5|Feb 11| | | 5|Feb 11| | ||
| - | |:::|Feb 14| Lab|Programming Assignment 2 | | + | |:::|Feb 14| Lab|[[public: |
| - | |:::|Feb 15| | + | |:::|Feb 15| 7|Propositional Logic | |
| - | | 6|Feb 18| 7|Propositional Logic | | + | | 6|Feb 18| 7|Propositional Logic, Logical Agents |
| - | |:::|Feb 21| Lab|? | | + | |:::|Feb 21| Lab|[[Lab 4 - Propositional Logic]] |
| |:::|Feb 22| 7|Logical Agents | |:::|Feb 22| 7|Logical Agents | ||
| | 7|Feb 25| 7, | | 7|Feb 25| 7, | ||
| - | |:::|Feb 28| Lab|Lab 3 - Logic | | + | |:::|Feb 28| Lab|time limits and caching with Alpha-Beta Search |
| |:::|Mar 01| 8, | |:::|Mar 01| 8, | ||
| | 8|Mar 04| | | 8|Mar 04| | ||
| - | |:::|Mar 07| Lab|Programming Assignment 2 - Results | + | |:::|Mar 07| Lab|[[public: |
| - | |:::|Mar 08| 13|Uncertainty | + | |:::|Mar 08| 10|Planning |
| - | | 9|Mar 11| | + | | 9|Mar 11| 13, 14|Uncertainty, |
| - | |:::|Mar 14| Lab|Lab | + | |:::|Mar 14| Lab|[[Lab 5 - Bayesian Networks]] | |
| - | |:::|Mar 15| | + | |:::|Mar 15| |
| - | | 10|Mar 18| 18-21|Machine Learning, Decision Trees | | + | | 10|Mar 18| 18-21, 18.3|Machine Learning, |
| - | |:::|Mar 21| Lab|Lab | + | |:::|Mar 21| Lab|[[Lab 6 - Learning Decision Trees]] |
| |:::|Mar 22| | |:::|Mar 22| | ||
| | 11|Mar 25| | | 11|Mar 25| | ||
| ^ Easter ^^^^ | ^ Easter ^^^^ | ||
| - | | 12|Apr 04| Lab|Lab | + | | 12|Apr 04| Lab|[[Lab 7 - Particle Filtering]] | |
| |:::|Apr 05| | |:::|Apr 05| | ||
| | 13|Apr 08| | | 13|Apr 08| | ||
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-13-1/main.1359707734.txt.gz · Last modified: 2024/04/29 13:32 (external edit)