When writing a dynamic programming algorithm, a problem's solution is formulated in terms of its smaller subproblem solution. The first thing you do when developing a dynamic programming algorithm is to formulate the recursive optimality constraint among subproblems. For example, optimal matrix chain multiplication:
m[i,i] = 0
m[i,j] = min { m[i,k] + m[k+1,j] + p[i-1]*p[k]*p[j] }
i<=k<j
Even the Cormen et al book does dynamic programming this way (starting with the recursive optimality). In general, this is enough to describe a memoized dynamic programming algorithm, since the details are always the same for these kinds of problems. I consider this more of a
logic programming formulation. It doesn't say "do this, do that", it only gives a production rule for constructing optimal subproblems and some base cases.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.