Calendar 2006
From 6.034 Wiki
(Difference between revisions)
(→September: move pset 1 forward a day) |
|||
| Line 10: | Line 10: | ||
| '''8'''<br>''No recitations or mega-recitation'' | | '''8'''<br>''No recitations or mega-recitation'' | ||
|- valign=top | |- valign=top | ||
| - | | '''11'''<br>Symbolic integration | + | | '''11'''<br>[http://courses.csail.mit.edu/6.034f/ai3/saint.pdf Symbolic integration] |
| '''12''' | | '''12''' | ||
| - | | '''13'''<br> | + | | '''13'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch3.pdf Goals and rules (pp.53-60)] <br>''[[Problem set 0|Pset 0]] due'' |
| '''14'''<br>''[[Problem set 1|Pset 1]] released'' | | '''14'''<br>''[[Problem set 1|Pset 1]] released'' | ||
| '''15'''<br>Mega-recitation: 11 AM in 32-123 | | '''15'''<br>Mega-recitation: 11 AM in 32-123 | ||
|- valign=top | |- valign=top | ||
| - | | '''18'''<br>Basic search | + | | '''18'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch4.pdf Basic search] |
| '''19''' | | '''19''' | ||
| - | | '''20'''<br>Optimal search<br>''[[Problem set 1|Pset 1]] due'' | + | | '''20'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch5.pdf Optimal search]<br>''[[Problem set 1|Pset 1]] due'' |
| '''21''' | | '''21''' | ||
| '''22'''<br>Mega-recitation | | '''22'''<br>Mega-recitation | ||
| Line 34: | Line 34: | ||
! Monday !! Tuesday !! Wednesday !! Thursday !! Friday | ! Monday !! Tuesday !! Wednesday !! Thursday !! Friday | ||
|- valign=top | |- valign=top | ||
| - | | '''2'''<br> | + | | '''2'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch6.pdf Games] |
| '''3'''<br> | | '''3'''<br> | ||
| - | | '''4'''<br> | + | | '''4'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch25.pdf Genetic algorithms] |
| '''5'''<br> | | '''5'''<br> | ||
| - | | '''6'''<br> | + | | '''6'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
|bgcolor="#eeeeff"| '''9'''<br>Columbus Day, Holiday | |bgcolor="#eeeeff"| '''9'''<br>Columbus Day, Holiday | ||
|bgcolor="#eeeeff"| '''10'''<br>Columbus Day, Holiday | |bgcolor="#eeeeff"| '''10'''<br>Columbus Day, Holiday | ||
| - | | '''11'''<br> | + | | '''11'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch12.pdf Constraints in drawings] |
| '''12'''<br> | | '''12'''<br> | ||
| - | | '''13'''<br> | + | | '''13'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''16'''<br> | + | | '''16'''<br>Constraints in maps and schedules |
| '''17'''<br> | | '''17'''<br> | ||
| - | | '''18'''<br> | + | | '''18'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch9.pdf Frames and representation] |
| '''19'''<br> | | '''19'''<br> | ||
| - | | '''20'''<br> | + | | '''20'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''23'''<br> | + | | '''23'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch26.pdf Learning to recognize objects] |
| '''24'''<br> | | '''24'''<br> | ||
|bgcolor="#ffffdd"| '''25'''<br>'''Quiz 2''' in lecture<br> | |bgcolor="#ffffdd"| '''25'''<br>'''Quiz 2''' in lecture<br> | ||
| '''26'''<br> | | '''26'''<br> | ||
| - | | '''27'''<br> | + | | '''27'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''30'''<br> | + | | '''30'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch19.pdf Nearest neighbor learning] |
| '''31'''<br> | | '''31'''<br> | ||
| | | | ||
| Line 72: | Line 72: | ||
| | | | ||
| | | | ||
| - | | '''1'''<br> | + | | '''1'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch21.pdf Identification tree learning] |
| '''2'''<br> | | '''2'''<br> | ||
| - | | '''3'''<br> | + | | '''3'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''6'''<br> | + | | '''6'''<br>[http://courses.csail.mit.edu/6.034f/ai3/netmath.pdf Neural net learning] |
| '''7'''<br> | | '''7'''<br> | ||
| - | | '''8'''<br> | + | | '''8'''<br>[http://courses.csail.mit.edu/6.034f/ai3/netmath.pdf Self-organizing maps] |
| '''9'''<br> | | '''9'''<br> | ||
|bgcolor="#eeeeff"| '''10'''<br>Veterans Day, Holiday | |bgcolor="#eeeeff"| '''10'''<br>Veterans Day, Holiday | ||
|- valign=top | |- valign=top | ||
| - | | '''13'''<br> | + | | '''13'''<br>[http://courses.csail.mit.edu/6.034f/ai3/SVM.pdf Support-vector machines] |
| '''14'''<br> | | '''14'''<br> | ||
|bgcolor="#ffffdd"| '''15'''<br>'''Quiz 3''' in lecture<br> | |bgcolor="#ffffdd"| '''15'''<br>'''Quiz 3''' in lecture<br> | ||
| '''16'''<br> | | '''16'''<br> | ||
| - | | '''17'''<br> | + | | '''17'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''20'''<br> | + | | '''20'''<br>[http://courses.csail.mit.edu/6.034f/ai3/msri.pdf Boosting] |
| '''21'''<br> | | '''21'''<br> | ||
| - | | '''22'''<br> | + | | '''22'''<br>The AI Busines |
|bgcolor="#eeeeff"| '''23'''<br>Thanksgiving, Holiday | |bgcolor="#eeeeff"| '''23'''<br>Thanksgiving, Holiday | ||
|bgcolor="#eeeeff"| '''24'''<br>Thanksgiving, Holiday | |bgcolor="#eeeeff"| '''24'''<br>Thanksgiving, Holiday | ||
|- valign=top | |- valign=top | ||
| - | | '''27'''<br> | + | | '''27'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch16.pdf Learning from near misses] |
| '''28'''<br> | | '''28'''<br> | ||
| - | | '''29'''<br> | + | | '''29'''<br>[http://courses.csail.mit.edu/6.034f/ai3/ch17.pdf Learning by explanation] |
| '''30'''<br> | | '''30'''<br> | ||
| | | | ||
| Line 110: | Line 110: | ||
| | | | ||
| | | | ||
| - | | '''1'''<br> | + | | '''1'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''4'''<br> | + | | '''4'''<br>To be determined |
| '''5'''<br> | | '''5'''<br> | ||
|bgcolor="#ffffdd"| '''6'''<br>'''Quiz 4''' in lecture<br> | |bgcolor="#ffffdd"| '''6'''<br>'''Quiz 4''' in lecture<br> | ||
| '''7'''<br> | | '''7'''<br> | ||
| - | | '''8'''<br> | + | | '''8'''<br>Mega-recitation |
|- valign=top | |- valign=top | ||
| - | | '''11'''<br> | + | | '''11'''<br>To be determined |
| '''12'''<br> | | '''12'''<br> | ||
| - | | '''13'''<br> | + | | '''13'''<br>Farewell summary |
| '''14'''<br> | | '''14'''<br> | ||
| '''15'''<br> | | '''15'''<br> | ||
Revision as of 12:54, 15 September 2006
Contents |
September
| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|
| 6 What is AI? Pset 0 released | 7 No recitations | 8 No recitations or mega-recitation | ||
| 11 Symbolic integration | 12 | 13 Goals and rules (pp.53-60) Pset 0 due | 14 Pset 1 released | 15 Mega-recitation: 11 AM in 32-123 |
| 18 Basic search | 19 | 20 Optimal search Pset 1 due | 21 | 22 Mega-recitation |
| 25 Student Holiday | 26 Students in Monday tutorials should attend a Tuesday tutorial. | 27 Quiz 1 in lecture Pset 2 released | 28 | 29 Mega-recitation |
October
| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|
| 2 Games | 3 | 4 Genetic algorithms | 5 | 6 Mega-recitation |
| 9 Columbus Day, Holiday | 10 Columbus Day, Holiday | 11 Constraints in drawings | 12 | 13 Mega-recitation |
| 16 Constraints in maps and schedules | 17 | 18 Frames and representation | 19 | 20 Mega-recitation |
| 23 Learning to recognize objects | 24 | 25 Quiz 2 in lecture | 26 | 27 Mega-recitation |
| 30 Nearest neighbor learning | 31 |
November
| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|
| 1 Identification tree learning | 2 | 3 Mega-recitation | ||
| 6 Neural net learning | 7 | 8 Self-organizing maps | 9 | 10 Veterans Day, Holiday |
| 13 Support-vector machines | 14 | 15 Quiz 3 in lecture | 16 | 17 Mega-recitation |
| 20 Boosting | 21 | 22 The AI Busines | 23 Thanksgiving, Holiday | 24 Thanksgiving, Holiday |
| 27 Learning from near misses | 28 | 29 Learning by explanation | 30 |
December
| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|
| 1 Mega-recitation | ||||
| 4 To be determined | 5 | 6 Quiz 4 in lecture | 7 | 8 Mega-recitation |
| 11 To be determined | 12 | 13 Farewell summary | 14 | 15 |
| 18 | 19 | 20 | 21 | 22 |
| 25 | 26 | 27 | 28 | 29 |
