CSE 471 Assigned Readings (from the text book)

• 8/22: Chapter 1
• 8/24: Chapter 2
• 8/29: Chapter 3
• 8/31: Chapter 4 (4.1;4.2)
• 9/5: Chapter 4 (4.1;4.2)
• 9/7: Chapter 4 (4.3;4.4)
• 9/12:Cahpter 11 (11.1;11.2;11.4)
• 9/14:Chapter 11 (11.1;11.2;11.3)
  • Optionally you can also read the first 5 sections of http://rakaposhi.eas.asu.edu/pgSurvey.pdf
• 9/19:Chapter 11 (11.4)
• 9/21: Chapter 17.1--17.3
• 9/26: Chapter 17.1--17.3
• 9/29: Chapter 6.1-6.3
• 10/3-10/6: Chapter 7
• 10/10-10/12 Chapter 13
• 10/17-10/20: Chapter 14
• 10/26: Exam
• 10/29: Chapter 8--Sec 8.1,8.2, first three parts of 8.3
• 11/2: Chapter 9- (9.1,9.2, 9.4, 9.5)
• 11/9: Chapter 10 (10.3--pg 328--334); Chapter 15 (15.5 first and then 15.1-->15.4 as time permits)
• 11/16: Chapter 18. Sections 1, 2, 5, 3 (in that order)
• 11/22: decision trees: 18.3; Naive-bayes classifiers: pp 718-719; Neural nets: 20.5

CSE 471 Supplementary Readings

• Telling Humans and Computers Apart: How Lazy Cryptographers do AI
• Winning DARPA Grand Challenge (Sebastian Thrun talk)

• **OPTIONAL** A paper that gives some description of the idea of pattern databases. The section called "Design of Heuristic Functions" is the relevant section. The section on Time Complexity of Heuristics gives an overview of how to use histogramming techniques to quantitatively predict a heuristic's performance.