Search
Now showing items 1-10 of 14
6.231 Dynamic Programming and Stochastic Control, Fall 2002
(2002-12)
Sequential decision-making via dynamic programming. Unified approach to optimal control of stochastic dynamic systems and Markovian decision problems. Applications in linear-quadratic control, inventory control, and resource ...
6.837 Computer Graphics, Fall 2003
(2003-12)
6.837 offers an introduction to computer graphics hardware, algorithms, and software. Topics include: line generators, affine transformations, line and polygon clipping, splines, interactive techniques, perspective ...
6.00 Introduction to Computer Science and Programming, Fall 2007
(2007-12)
This subject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless ...
15.083J / 6.859 Integer Programming and Combinatorial Optimization, Fall 2004
(2004-12)
The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, ...
6.172 Performance Engineering of Software Systems, Fall 2009
(2009-12)
Modern computing platforms provide unprecedented amounts of raw computational power. But significant complexity comes along with this power, to the point that making useful computations exploit even a fraction of the ...
6.047 / 6.878 Computational Biology: Genomes, Networks, Evolution, Fall 2008
(2008-12)
This course focuses on the algorithmic and machine learning foundations of computational biology, combining theory with practice. We study the principles of algorithm design for biological datasets, and analyze influential ...
6.251J / 15.081J Introduction to Mathematical Programming, Fall 2002
(2002-12)
This course offers an introduction to optimization problems, algorithms, and their complexity, emphasizing basic methodologies and the underlying mathematical structures. The main topics covered include: Theory and algorithms ...
6.046J Introduction to Algorithms (SMA 5503), Fall 2004
(2004-12)
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph ...
6.00SC Introduction to Computer Science and Programming, Spring 2011
(2011-06)
This subject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless ...
15.082J / 6.855J Network Optimization, Spring 2003
(2003-06)
15.082J/6.855J is an H-level graduate subject in the theory and practice of network flows and its extensions. Network flow problems form a subclass of linear programming problems with applications to transportation, ...