| J. Hilden. Elimination of recursive calls using a small table of randomly selected function values. BIT, 16(1):60--73, 1976. |
....from a function call can be stored then the call need not be calculated again but can simply be retrieved from the stored value. Storing the result of all function calls may increase time eciency but is very space inecient. To limit the size of the look up table scheduling strategies can be used [Hil76] Various other strategies can be employed to determine or estimate exactly which function calls will be needed in the future. These include local memoisation, exact tabulation and over tabulation [Bir80] Cohen [Coh83] uses descent conditions and directed acyclic dependency graphs to determine ....
J. Hilden. Elimination of recursive calls using a small table of \randomly" selected function values. bit, 16(1):60-73, 1976.
No context found.
J. Hilden. Elimination of recursive calls using a small table of randomly selected function values. BIT, 16(1):60--73, 1976.
No context found.
J. Hilden. Elimination of recursive calls using a small table of randomly selected function values. BIT, 16(1):60--73, 1976.
No context found.
J. Hilden. Elimination of recursive calls using a small table of randomly selected function values. BIT, 16(1):60--73, 1976.
No context found.
J. Hilden. Elimination of recursive calls using a small table of randomly selected function values. BIT, 16(1):60--73, 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC