Time-memory Trade-off

A time-memory trade-off is a situation in computer programming where the programmer can reduce memory use at the cost of slower program execution, or can reduce computation time at the cost of increased memory use. The most common situation is an algorithm involving a lookup table: an implementation can include the entire table, which reduces computing time, but increases the amount of memory needed, or it can compute table entries as needed, increasing computing time, but reducing memory requirements.

 

<< PreviousWord BrowserNext >>
theo van gogh (art dealer)
francisco umbral
honda ridgeline
pechora
2001 british leaders
richard quest
sandford principle
ten years war
mike duhaney
source of all evil
tancred, prince of galilee
arctic winter games
golan trevize
pisano period
gilberto martinez
wyatt matthew halliwell
kevin ambler
eddie lewis
syedna burhanuddin
strategic group
izabela fleming
wilmington, sussex
matt carter
flowing tears
english leaders in 1514
churchill river (hudson bay)
sylvester's law of inertia
jerzy detloff fleming
angus eve
guam general election, 2004
aquinas college
antonina czartoryska
bert patenaude
sporopollenin
verdens ende
frank zane
beaumont le roger
rulers of the giba state of limu 'enarya
tuple versioning
rulers of the giba state of goma
defence force
oris paxton van sweringen
rulers of the giba state of guma
gerrie knetemann