Optimal Replacement Is NP-Hard for Nonstandard Caches.

Mark Brehob Stephen Wagner Eric Torng Richard J. Enbody

Published in: IEEE Trans. Computers (2004)

Keyphrases

np hard
optimal solution
worst case
minimum cost
dynamic programming
approximation algorithms
greedy heuristic
real world
computational complexity
optimal design
scheduling problem
branch and bound algorithm
np hardness
replacement policy