Princeton University |
Computer Science 302 |
|
Numbers in brackets under "readings" refer to chapters or sections of Russell & Norvig.
# |
Date |
Topic |
Readings |
1 | M 9/15 | General introduction to AI. | [1]
AI Growing Up by James Allen (but skip or skim page 19 to end). |
2 | W 9/17 | Uninformed (blind) search | [3.1-3.5] |
3 | M 9/22 | Informed (heuristic) search; local search. | [4.1-4.3] |
4 | W 9/24 | Searching in games; finish local search. | [6] |
5 6 |
M 9/29 W 10/1 |
Propositional logic | [7.1-7.6] |
7 | M 10/6 | Guest lecture: Gilbert Harman, Professor of Philosophy, "A Philosopher's View of AI" |
slides [26] |
8 | W 10/8 | Planning using propositional logic | [11.1, 11.5] |
First order logic | [8.1-8.3] (skim only) | ||
9 | M 10/13 | Probability and uncertainty | [13.1-13.6] |
10 11 |
W 10/15 M 10/20 |
Probabilistic reasoning using Bayesian networks |
[14.1-14.5] Corrected MCMC proof |
12 13 |
W 10/22 M 11/3 |
Uncertainty over time (temporal models; HMM's) | [15.1-15.3] |
14 | W 11/5 | More temporal uncertainty | [15.4-15.5] |
15 | M 11/10 | Speech recognition | [15.6] |
16 | W 11/12 | Decision theory; Markov decision processes | [16.1-16.3]; [17.1] |
17 18 |
M 11/17 W 11/19 |
More MDP's | [17.2-17.4] |
19 | M 11/24 | Machine learning | [18.1-18.2] |
20 | W 11/26 |
Decision trees Computational learning theory |
[18.3] [18.5] |
21 | M 12/1 | Boosting |
[18.4] slides training error proof |
22 | W 12/3 |
Support-vector machines Neural networks |
[20.6] [20.5] |
23 | M 12/8 | Learning Bayes net and HMM parameters | [20.1-20.3] |
24 |
W 12/10 | Learning in MDP's | [21.1-21.4] |
AAAI website with LOTS of readings on AI in general, AI in the news, etc.
Robocup website. The simulation league movies were taken from here. (Click on "results", and then on the "F" next to any match.) The four-legged robot league movies were taken from here.
The particle filtering demo came from here on Sebastian Thrun's website.
A survey on solving satisfiability problems. SAT-2003 conference, including pointer to an annual competition.