memoization


Also found in: Wikipedia.

memoization

Mentioned in ?
References in periodicals archive ?
This use of memory is also at the base of the closely related process called memoization (Popplestone 1967; Michie 1967).
In very Hard Problems you can find problems related to cryptography, binary search, recursion, memoization, dynamic programming, pattern recognition, etc.
"A way memoization technique for reducing power consumption of caches in application specific integrated processors," in Proc.
Using the classic trick of memoization (see [14]), this recurrence can be easily transformed into a dynamic programming scheme with memoization that runs in time absolute value of G] x [n.sup.O(1)], where G [subset or equal to] [2.sup.V] is the set of strongly connected subsets of the digraph G.
Yet another approach is considering a method as a view and materializing it into a table (known as memoization in programming languages).
The major difference is that UBS systems memorize partially matched redexes during rewriting, whereas our work avoids memoization and tries to improve on the search strategy.
Okasaki [1995] gives a variation of this simulation that uses "memoization" to avoid some of the explicit stack-to-stack copying; his solution gives persistence but is not purely functional since memoization is a side effect.
The expressions for which the static reducer generates such procedures are called memoization points.
The first improvements speed solution extraction: forward checking, memoization, and explanation-based learning.
To be precise, BIND has the unboundness condition x [is not an element of] lhs([Sigma]),(4) and MEMO and DEREFERENCE both have the memoization condition MEM(x = u, [Mu]).
Some other dynamic compilation systems [Consel and Noel 1996; Leone and Lee 1996] memoize dynamic code fragments: in the case of `C, the low overhead required to create code specifications, their generally small size, and their susceptibility to changes in the run-time environment make memoization of cspecs and vspecs unattractive.
Our algorithm is simpler than previous linear-time algorithms: rather than employ complicated data structures, we combine the use of microtrees and memoization with new observations on a restricted class of path compressions.