6.034 Artificial Intelligence, Fall 2003
 Recitations

Instructor:  Prof. Bob Berwick

Thurs
3
 26-310
Thurs
4
 26-210
Fri
10
26-314

                                       
                                        Office hours: Friday, 11-12 (email for other times)

Week
Topic
Handouts, etc.
 1
Introduction Notes
 2
Rules Notes , Solutions
 3
Search
Notes,  Solutions
 4
Optimal Search + Games Search complexity  Notes, Solutions, Game Slides, Alpha-beta example  Alpha-beta summary sheet
 5
Constraints
Alpha-beta example solutionsNotes & solutions
 6
Rete Rete prob & example solution;  Rete example 2 & soln; Recitation Notes
 7
Semantic Transition Trees
Recitation Notes    Physics language & problem solver
 8
Frames
Recitation Notes   Slides on Language
 9
Nearest Neighbors + ID Trees
Recitation Notes (now posted!);  kNN java applet demo; ID Tree Java Applet Demo
10
Neural Nets (+ GAs)
Recitation Notes  Notes on Backprop, Backprop Simulation
11
Support Vector Machines Recitation Notes  SVM "guide for the perplexed"; Svm practice  Problems & Solutions; GA demo
12
SVM, Near Miss,
Learning from examples
Svm practice  Problems II & Solutions;
Near-miss problem & solutions
13
[holiday, no recitation]

14 Final Exam Review



Prof. Bob Berwick
Room 35-423 | Massachusetts Institute of Technology | Cambridge, MA 02139
Voice: 617/253-8918
Email: berwick@ai.mit.edu  (perferred)