5 Matching Annotations
  1. Mar 2017
  2. awjin.github.io awjin.github.io
    1. Dynamic Programming

      Here's another article, with a different point-of-view on this subject.

    1. Check out

      Some other problems can be found in the quoted works section, for this paper/web page. For example, have a look here.

    2. In this solution, we used memoization to recursively calculate the solutions for subproblems which we then used to calculate the solutions to larger problems. Alternatively, tabulation could have been used to build up solutions from the bottom up.

      So, from the whole thing I take it that the problem has actually two parts: i.) a pre-processing part in which all paths have been explored (via memoization), and, ii). discover the optimal path to take, given the memoization table.