News
It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .
IEMS 469: Dynamic Programming VIEW ALL COURSE TIMES AND SESSIONS Prerequisites Basic knowledge of probability (random variables, expectation, conditional probability), optimization (gradient), ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback