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.

Dynamic programming (DP) algorithms have become indispensable in computational biology, addressing problems that range from sequence alignment and phylogenetic inference to RNA secondary structure ...

CS 336 or Permission of Instructor Description This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, ...

Manuel S. Santos, , Analysis of a Numerical Dynamic Programming Algorithm Applied to Economic Models, Econometrica, Vol. 66, No. 2 (Mar., 1998), pp. 409-426 ...

Greedy Algorithms Dynamic Programming Algorithms Algorithms for the following primitives: Sorting: bubblesort, mergesort, heapsort, quicksort. Searching Graph Algorithms: Depth/Breadth First Search, ...

The project required bringing together years of research in approximate dynamic programming, merging math programming with machine learning, to solve dynamic programs with extremely high-dimensional ...

Thinking about getting good at competitive programming, especially on a platform like CodeChef? It can seem like ...

Dynamic Programming and Optimal Control 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 ...

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 ...