Share in:

This course studies basic optimization and the principles of optimal control. It considers deterministic and stochastic problems for both discrete and continuous systems. The course covers solution methods including numerical search algorithms, model predictive control, dynamic programming, variational calculus, and approaches based on Pont

Share in:

This course surveys a variety of reasoning, optimization and decision making methodologies for creating highly autonomous systems and decision support aids. The focus is on principles, algorithms, and their application, taken from the disciplines of artificial intelligence and operations research. Reasoning paradigms include logic and deduc

Share in:

Serving as an introduction to computational biology, this course emphasizes the fundamentals of nucleic acid and protein sequence analysis, structural analysis, and the analysis of complex biological systems. The principles and methods used for sequence alignment, motif finding, structural modeling, structure prediction, and network modelin

Share in:

This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear

Share in:

This course is a survey of modern macroeconomics at a fairly advanced level. Topics include neoclassical and new& growth theory, consumption and saving behavior, investment, and unemployment. It also includes use of the dynamic programming techniques. Assignments include problem sets and written discussions of macroeconomic events. This cou

Share in:

This course is a survey of modern macroeconomics at a quite advanced level. Topics include the neoclassical growth model, overlapping generations, endogenous growth models, business cycles, incomplete nominal adjustment, incomplete financial markets, fiscal and monetary policy, consumption and savings, and unemployment. The course is also a

Share in:

Introduction to the theories of economic growth. Topics will include basic facts of economic growth and long-run economic development; brief overview of optimal control theory and dynamic programming; basic neoclassical growth model under a variety of market structures; human capital and economic growth; endogenous growth models; models wit

Share in:

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for th

Share in:

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic a

Share in:

This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear program

Share in:

This course introduces the basic computational methods used to understand the cell on a molecular level. It covers subjects such as the sequence alignment algorithms: dynamic programming, hashing, suffix trees, and Gibbs sampling. Furthermore, it focuses on computational approaches to: genetic and physical mapping; genome sequencing, assemb

Share in:

This course is an introduction to the theory and application of large-scale dynamic programming. Topics include Markov decision processes, dynamic programming algorithms, simulation-based algorithms, theory and algorithms for value function approximation, and policy search methods. The course examines games and applications in areas such as