Projects

The final project consists of a 10-15 page project report and 15-20 minute presentation. Students have option of working on theory, algorithms and / or applications. Project proposals are submitted midway through the term, with the final project due at the end of the term.

Some representative projects are presented in the table below, courtesy of the student author(s).

Grading information.
TOPICS	STUDENTS	PROJECTS
Approximate Dynamic Programming (Via Linear Programming) for Stochastic Scheduling	Mohamed Mostagir Nelson Uhan	Paper (PDF) (Courtesy of Mohamed Mostagir and Nelson Uhan. Used with permission.) Slides (PDF) (Courtesy of Mohamed Mostagir and Nelson Uhan. Used with permission.)
How to choose the State Relevance Weight in the Approximate Linear Programming Approach for Dynamic Programming?	Yann Le Tallec Theophane Weber	Paper (PDF) (Courtesy of Yann Le-Tallec and Theophane Weber. Used with permission.) Slides (PDF) (Courtesy of Yann Le-Tallec and Theophane Weber. Used with permission.)
Decentralized Strategies for the Assignment Problem	Hariharan Lakshmanan	Slides (PDF) (Courtesy of Hariharan Lakshamanan. Used with permission.)

MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.

Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.

Find courses by:

Collections

Cross-Disciplinary Topic Lists

Translated Courses

Projects

Courses

About

Donate

Featured Sites

Tools

About MIT OpenCourseWare

Our Corporate Supporters