CS440: Introduction to Artificial Intelligence

User Tools

Site Tools

Trace:
schedule

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision 		Previous revision
Next revision Both sides next revision
schedule [2016/01/12 13:33]
127.0.0.1 external edit 		schedule [2017/10/05 10:58]
anderson [October]
Line 1: Line 1:
 ====== Schedule ====== ====== Schedule ======
  
-== January ==+===== Announcements =====
  
-^ Week      ^ Topic      ^ Material  ^ Reading          ^ Assignments  ^ +Sept 7:  Assignment 2 is now complete.
-| Week 1: Jan 19 - Jan 22    | Overview.     | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs480/notebooks/01 Course Overview.ipynb|01 Course Overview]] |  Chapter 1        | +
-| Week 2: Jan 25 - Jan 29    |      |       |+
  
-== February ==+Aug 31: Assignment 1 now includes another example.
  
-^ Week      ^ Topic      ^ Reading          ^ Assignments  ^ 
-| Week 3: Feb 1 - Feb 5    |      |       | 
-| Week 4: Feb 8 - Feb 12    |      |       | 
-| Week 5: Feb 15 - Feb 19    |      |       | 
-| Week 6: Feb 22 - Feb 26    |      |       | 
  
-== March ==+Lecture videos are available from the Canvas site (in the menu on the left) by selecting [[https://colostate.instructure.com/courses/55296/external_tools/2755|Echo 360]].
  
-^ Week      ^ Topic      ^ Reading          ^ Assignments  ^ +To use jupyter notebooks on our CS department machines, you must add this line to your .bashrc file:
-| Week 7: Feb 29 - Mar 5    |      |       | +
-| Week 8: Mar 7 - Mar 11    |      |       | +
-|  Mar 14 - Mar 18    |  Spring Break!    |       | +
-| Week 9: Mar 21 - Mar 25    |      |       | +
-| Week 10: Mar 28 - Apr 1    |      |       |+
  
-== April ==+  export PATH=/usr/local/anaconda/bin:$PATH
  
-^ Week      ^ Topic      ^ Reading          ^ Assignments  ^ +/* 
-| Week 11: Apr 4 - Apr 8    |      |       | +are available at this [[https://echo.colostate.edu/ess/portal/section/a5759ae3-82dc-43df-b515-dd944a6c4976|CS480 video recordings site]]. 
-| Week 12: Apr 11 - Apr 15    |      |       | +*/ 
-| Week 13: Apr 18 - Apr 22    |      |       | + 
-| Week 14: Apr 25 - Apr 29    |      |       |+ 
 +===== August ===== 
 + 
 +|< 100% 10% 20% 30% 20% 20%  >| 
 +^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^ 
 +| Week 1:\\  Aug 21 - Aug 25    | What is AI?  Promises and fears.\\ Python review.\\ Problem-Solving Agents.  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/01 Introduction to AI.ipynb|01 Introduction to AI]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/02 Introduction to Python.ipynb|02 Introduction to Python]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/03 Problem-Solving Agents.ipynb|03 Problem-Solving Agents]]   | Chapters 1, 2, 3.1.\\ [[http://science.sciencemag.org/content/357/6346/7.full|AI, People, and Society]], by Eric Horvitz.\\ [[https://aeon.co/essays/can-we-design-machines-to-make-ethical-decisions|Automated Ethics]], by Tom Chatfield.\\ [[http://www.nytimes.com/2016/12/14/magazine/the-great-ai-awakening.html?_r=0|The Great A.I. Awakening]], by Gideon Lewis-Krause, NYT, Dec 14, 2016.\\ [[https://www.commondreams.org/news/2017/07/19/fundamental-existential-threat-lawmakers-warned-risks-killer-robots|"Fundamental Existential Threat": Lawmakers Warned of the Risks of Killer Robots]], by Julia Conley\\ Section 1 of [[http://www.scipy-lectures.org|Scipy Lecture Notes]]   |  |  
 +| Week 2:\\ Aug 28 - Sept 1    | Problem-solving search and how to measure performance.\\ Iterative deepening and other uninformed search methods.   | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/04 Measuring Search Performance.ipynb|04 Measuring Search Performance]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/05 Iterative Deepening and Other Uninformed Search Methods.ipynb|05 Iterative Deepening and Other Uninformed Search Methods]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/06 Python Implementation of Iterative Deepening.ipynb|06 Python Implementation of Iterative Deepening]]    | Sections 3.1 - 3.4  |   |  
 + 
 + 
 +===== September ===== 
 + 
 +|< 100% 10% 20% 30% 20% 20%  >| 
 +^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^ 
 +| Week 3:\\ Sept 4 - Sept 8  | Informed search. A* search. Python classes, sorting, numpy arrays.  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/07 Informed Search.ipynb|07 Informed Search]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/08 Python Classes.ipynb|08 Python Classes]]  | Rest of Chapter 3  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A1 Uninformed Search.ipynb|A1 Uninformed Search]] due Tuesday, September 5th, at 10:00 PM.\\ Here are examples of good A1 notebooks: [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-a.ipynb|a]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-b.ipynb|b]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-c.ipynb|c]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-d.ipynb|d]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-e.ipynb|e]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-f.ipynb|f]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-g.ipynb|g]]  | 
 +| Week 4:\\ Sept 11 - Sept 15   | A* optimality, admissible heuristics, effective branching factor.\\ Local search and optimization.  |[[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/09 Heuristic Functions.ipynb|09 Heuristic Functions]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/10 Local Search.ipynb|10 Local Search]]  | Chapter 4  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A2 Iterative-Deepening Search.ipynb|A2 Iterative-Deepening Search]] due Thursday, September 14th, at 10:00 PM.\\ [[http://www.cs.colostate.edu/~anderson/cs440/notebooks/A2answer.tar|A2answer.tar]]   | 
 +| Week 5:\\ Sept 18 - Sept 22   | Adversarial search. Minimax. Alpha-beta pruning. Stochastic games.  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/11 Adversarial Search.ipynb|11 Adversarial Search]] | Chapter 5  | 
 +| Week 6:\\ Sept 25 - Sept 29   | Negamax, with pruning. | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/12 Negamax.ipynb|12 Negamax]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/13 Modern Game Playing.ipynb|13 Modern Game Playing]]    |   | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A3 A*, IDS, and Effective Branching Factor.ipynb|A3 A*, IDS, and Effective Branching Factor]] due Friday, September 29th, at 10:00 PM.   | 
 + 
 +===== October ===== 
 + 
 +|< 100% 10% 20% 30% 20% 20%  >| 
 +^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^ 
 +| Week 7:\\ Oct 2 - Oct 6  | Introduction to Reinforcement Learning.  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/14 Introduction to Reinforcement Learning.ipynb|14 Introduction to Reinforcement Learning]]\\ [[reinflearn2|Part 2]]   | Chapter 21\\ [[http://incompleteideas.net/sutton/book/the-book-2nd.html|Reinforcement Learning: An Introduction]]  |  | 
 +| Week 8:\\ Oct 9 - Oct 13  |  |  |  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A4 Negamax with Alpha-Beta Pruning and Iterative Deepening.ipynb|A4 Negamax with Alpha-Beta Pruning and Iterative Deepening]] due Wednesday, October 11th, at 10:00 PM.  | 
 +| Week 9:\\ Oct 16 - Oct 20  |  
 +| Week 10:\\ Oct 23 - Oct 27  |  
 + 
 +===== November ===== 
 + 
 +|< 100% 10% 20% 30% 20% 20%  >| 
 +^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^ 
 +| Week 11:\\ Oct 30 - Nov 3  |   |  |  | 
 +| Week 12:\\ Nov 6 - Nov 10  |  |  |  | 
 +| Week 13:\\ Nov 13 - Nov 17  |  |  |  | 
 +|  Nov 20 - Nov 24  |  Fall Break  | 
 +| Week 14:\\ Nov 27 - Dec 1  | Constraint satisfaction. Min-conflicts  |  | Chapter 6.\\ [[http://dl.acm.org/citation.cfm?id=1928809|A new iterated local search algorithm for solving broadcast scheduling problems in packet radio networks]]  |  
 + 
 +===== December ===== 
 + 
 +|< 100% 10% 20% 30% 20% 20%  >| 
 +^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^ 
 +| Week 15:\\ Dec 4 - Dec 8  | Propositional and First-Order Logic. Introduction to Prolog.  |  | Chapters 7, 8, 9  |  
 +| Finals Week:\\ Dec 11 - Dec 15  |   |  |  |
  
-== May == 
  
-^ Week      ^ Topic      ^ Reading          ^ Assignments  ^ 
-| Week 15: May 2 - May 6    |      |       | 
  
schedule.txt · Last modified: 2024/01/08 18:40 (external edit)

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
CC Attribution-Noncommercial-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki