[<<][compsci][>>][..]
Mon Sep 21 12:54:33 CEST 2009

Dynamic Programming

Subdivide and memoize to avoid exponential explosion.

What I never realized is that Recursive Least Squares (RLS) falls in
this category, and in general all ``update'' stream-based algorithms.

In [2] a technique is mentioned that centralizes memoization in a
y-combinator.  For more about this see [3].

[1] http://en.wikipedia.org/wiki/Dynamic_programming
[2] http://okmij.org/ftp/Computation/staging/circle-shift.pdf
[3] http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.495&rep=rep1&type=pdf



[Reply][About]
[<<][compsci][>>][..]