| Class |
Date |
Lecture/Discussion Topic |
Reading Assignment Due |
Homework/Assignments |
| 1 |
9/7 |
Human and Machine Intelligence |
|
| 2 |
9/9 |
AI Roots, Scope & Applications |
Luger, Ch 1 |
|
| 3 |
9/14 |
AI Approaches: Symbolic AI |
Luger, pp. 35-44 |
|
| 4 |
9/16 |
Approaches: Neural Networks
| Luger, Ch 11.0-11.2, 12.0-12.1 |
|
| 5 |
9/21 |
Approaches: Genetic Algorithms,
Slides (pdf) |
|
|
| 6 |
9/23 |
Symbolic Logic Review,
The Unification Algorithm |
Luger, Ch 2.0-2.3 |
Hmk: Logic Problems |
| 7 |
9/28 |
PROLOG Basics |
Luger, Chapter 15.0-15.1 |
Hmk: Family Database |
|
| 8 |
9/30 |
PROLOG ADTs |
Luger, Chapter 15.2 |
|
| 9 |
10/5 |
State Space Search |
Luger, Ch 3.0-3.3 |
Hmk: State Space Assignment |
| 10 |
10/7 |
PROLOG Production System |
Luger, Chapter 15.3 |
Hmk: Family Database, #3 |
| 11 |
10/12 |
Catch-up/Exam Review |
|
| 12 |
10/14 |
Midterm Exam |
Midterm Exam, Ch 1-3,11.0-11.1, 12.0-12.1, 15.0-15.2 |
| 13 |
10/19 |
Heuristic Search |
Luger, Ch 4.0 - 4.2 |
Hmk: Heuristics Exercises
|
|
|
| 14 |
10/21 |
Minimax, Alpha-Beta Pruning |
Luger Ch 4.3 - 4.4 |
|
| 15 |
10/26 |
PROLOG: Knight's Tour |
Luger Ch 15.1.4 |
Hmk: Simplified Knight's Tour |
|
| 16 |
10/28 |
Best First Search in PROLOG;
A* Algorithm |
Luger Ch 15.4, 4.2 |
|
| 17 |
11/2 |
Machine Learning (Classical) |
Luger, Ch 10.0-10.2 |
|
|
| 18 |
11/4 |
Machine Learning: ID3 |
Luger, Ch 10.3-10.4 |
Hmk: Machine Learning Problems |
| 19 |
11/9 |
Machine Learning (Neural Networks) |
Luger, Ch 11.1-11.3 |
|
| 20 |
11/11 |
Encog Lab |
|
Hmk: Heuristic Programming Project |
| 21 |
11/16 |
Hopfield Networks (Encog) |
Hopfield Network |
|
| 22 |
11/18 |
Support Vector Machines |
Support Vector Machine |
|
| Thanksgiving Break -- |
| 23 |
11/30 |
Evolutionary Computation: Applications |
GAs in Cryptology (PDF)
Traveling Salesman Problem
GAs in Genomic Analysis (PDF)
GAs in Art
|
Hwk: GA Applications |
| 24 |
12/2 |
Evolutionary Computation: Breaking Short Cryptograms with a GA |
The God Gene
What is IBMs Watson?
|
Hmk: Evolutionary Computation Essay |
| 25 |
12/7 |
Evolutionary Computation: Breaking Polyalphabetic Ciphers with a GA |
|
|
| 26 |
12/9 |
|
|
|
| 27 |
12/16 noon |
Final Examination |
|
|