|
Boost : |
From: David Abrahams (dave_at_[hidden])
Date: 2003-12-14 14:21:59
Dave Gomboc <dave_at_[hidden]> writes:
>> > It might help some of us more ignorant folk if you'd post a
>> > definition of "memoization".
>>
>> and of dynamic programming too and how it differs from memoization :-)
>
> http://www.nist.gov/dads/HTML/dynamicprog.html
> http://www.nist.gov/dads/HTML/memoize.html
>
> Do a web search on the three words, then click through a few links to some
> Computing Science departments, and you'll be able to read all about it.
> Or, crack open that old design and analysis of algorithms textbook. :-)
This:
dynamic programming (algorithmic technique)
Definition: An algorithmic technique in which an optimization
problem is solved by caching subproblem solutions (memoization)
rather than recomputing them.
seems to contradict Mr. Apple's definition.
-- Dave Abrahams Boost Consulting www.boost-consulting.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk