Dynamic Programming, Greedy Algorithms can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform.

In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...

View on Coursera Course Description This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving ...

Brief Description of Course Content Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and ...

Hugo P. Simão, Jeff Day, Abraham P. George, Ted Gifford, John Nienow, Warren B. Powell, An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application, ...

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

Dynamic Programming and Optimal Control is offered within DMAVT and attracts in excess of 300 students per year from a wide variety of disciplines. It is an integral part of the Robotics, System and ...