R: 9/5		Organizational meeting (1)
T: 9/10		MDPs: notation and results (2)
R: 9/12		MDPs: algorithms (2)
T: 9/17		MDPs: discussion of sample problems
R: 9/19		MDPs: accelerated algorithms (3)
T: 9/24		VFA: TD-gammon (4,5) (full hour lecture)
R: 9/26		<no class>
T: 10/1		VFA: positive and negative results (6); discuss: load balancing
R: 10/3		discuss: GALA and MDP specifications
T: 10/8		VFA: justified algorithms (6b)
R: 10/10	VFA: discussion (case studies)
T: 10/15	project discussion
R: 10/17	planning: STRIPS and nonlinear planning (7a)
T: 10/22	<Fall Break: no class>
R: 10/24	planning: faster STRIPS planning (7b)
T: 10/29	planning: stochastic STRIPS (8a)
R: 10/31	planning: Buridan (8b)
T: 11/5		planning: structured approaches to clustering (8c)
R: 11/7		Wrap up discussion
T: 11/12	project discusssion
R: 11/14	<Instructor off: no class>
T: 11/19	POMDPs: model
R: 11/21	POMDPs: exact algorithms
T: 11/26	<Instructor off: no class>
R: 11/28	<Thanksgiving: no class>
T: 12/3		Markov games
R: 12/5		Reachability and Abstraction
T: 12/10	reading period (project)
R: 12/12	reading period (project)