Definitions

from Wiktionary, Creative Commons Attribution/Share-Alike License.

  • noun computer science A technique in which partial results are recorded (forming a memo) and then can be re-used later without having to recompute them.

Etymologies

from Wiktionary, Creative Commons Attribution/Share-Alike License

From memoize +‎ -ation, or memo +‎ -ization.

Support

Help support Wordnik (and make this page ad-free) by adopting the word memoization.

Examples

  • Besides, the above implementation does not take any advantage of memoization, which is yet another secret sauce behind speedups of functional implementations.

    Ruminations of a Programmer 2008

  • Besides, the above implementation does not take any advantage of memoization, which is yet another secret sauce behind speedups of functional implementations.

    Ruminations of a Programmer 2008

  • Besides, the above implementation does not take any advantage of memoization, which is yet another secret sauce behind speedups of functional implementations.

    Ruminations of a Programmer 2008

  • Um, I mean you can't implement same kind of memoization as in Clojure -- it does not change function signature, but it caches all function calls.

    Netvouz - new bookmarks 2010

  • This kind of memoization requires persistent storage, but if function signature (say, Int -

    Netvouz - new bookmarks 2010

  • Compilation and memoization can yield 100-fold speed-ups. [p. 307]

    Netvouz - new bookmarks laughingboy 2010

  • This is an example of implementation of Fibonacci function and it's memoization.

    eggheadcafe.com articles 2010

  • Haskell's model is not incompatible with memoization, it is just that it is not possible to implement same sort of memoization as in dynamic programming languages on a user level, because transparent memoization

    Netvouz - new bookmarks 2010

  • Why didn't you guys just embed the memoization logic inside the - measure - method?

    Kevin Smith 2010

  • Here's where the remembered values (or memoization, if you prefer) come in.

    Kevin Smith 2010

  • In the next two sections, I’ll explain what a sub-problem is, and then motivate why storing solutions — a technique known as memoization — matters in dynamic programming.

    Demystifying Dynamic Programming – freeCodeCamp 2017

Comments

Log in or sign up to get involved in the conversation. It's quick and easy.