Keywords: Dynamic Programming
Displaying 1-16 of 16 results.
Advanced Algorithms, Fall 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: 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 ... More »
Algorithms
| Rating: | |
| Type: | Course Related Materials |
Abstract: The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and ... More »
Decision Making in Large Scale Systems, Spring 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: Introduction to the theory and application of large-scale dynamic programming. Markov decision processes. Dynamic programming algorithms. Simulation-based algorithms. Theory and algorithms for value function approximation. Policy search methods. Games. Applications in areas such as dynamic resource allocation, ... More »
Dynamic Programming and Stochastic Control, Fall 2002
| Rating: | |
| Type: | Course Related Materials |
Abstract: 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 allocation models. Optimal decision making under perfect and imperfect state ... More »
Dynamic Programming Fall 2007
| Rating: | |
| Type: | Course Related Materials |
Abstract: Dynamic Programming. From CS 61B: Data Structures - Fall 2007. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for ... More »
Foundations of Computational and Systems Biology, Spring 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: Introduction to computational biology including the fundamentals of protein and nucleic acid sequence analysis, phylogenetic analysis, motif finding, hidden Markov models, and 3D structure prediction and modeling. An overview of emerging fields including expression profiling, quantitative image analysis ... More »
Intermediate Macroeconomic Theory, Spring 2003
| Rating: | |
| Type: | Course Related Materials |
Abstract: Survey of modern macroeconomics at a fairly advanced level. Topics include neoclassical and new growth theory, consumption and saving behavior, investment, and unemployment. Use of the dynamic programming techniques. Assignments include problem sets and written discussions of macroeconomic events. Recommended ... More »
Intermediate Macroeconomic Theory, Spring 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: Survey of modern macroeconomics at a fairly advanced level. Topics include neoclassical and new growth theory, consumption and saving behavior, investment, and unemployment. Use of the dynamic programming techniques. Assignments include problem sets and written discussions of macroeconomic events. Recommended ... More »
Introduction to Algorithms (SMA 5503), Fall 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: 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 algorithms; shortest paths; network flow; computational geometry; number-theoretic ... More »
Introduction to Algorithms (SMA 5503), Fall 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: 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 algorithms; shortest paths; network flow; computational geometry; number-theoretic ... More »
Introduction to Computational Molecular Biology, Fall 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: Introduces the basic computational methods used to understand the cell on a molecular level. Covers sequence alignment algorithms: dynamic programming, hashing, suffix trees, Gibbs sampling. Focuses on computational approaches to: genetic and physical mapping; genome sequencing, assembly, and annotation; ... More »
Macroeconomic Theory I, Spring 2007
| Rating: | |
| Type: | Course Related Materials |
Abstract: Models of economic growth, old and new. Half-term subject. 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 ... More »
Optimization Methods (SMA 5213), Fall 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods ... More »
Principles of Autonomy and Decision Making, Fall 2003
| Rating: | |
| Type: | Course Related Materials |
Abstract: 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 applications, taken from the disciplines of artificial intelligence and operations research. ... More »
Principles of Autonomy and Decision Making, Fall 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: 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 applications, taken from the disciplines of artificial intelligence and operations research. ... More »
Principles of Optimal Control, Spring 2006
| Rating: | |
| Type: | Course Related Materials |
Abstract: Studies the principles of deterministic optimal control. Variational calculus and Pontryagin's maximum principle. Applications of the theory, including optimal feedback control, time-optimal control, and others. Dynamic programming and numerical search algorithms introduced briefly.
Loading...
