scientific article; zbMATH DE number 2011845
From MaRDI portal
Publication:4437497
zbMath1032.68988MaRDI QIDQ4437497
Joan. Boyar, Lene Monrad Favrholdt
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530058.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Separating online scheduling algorithms with the relative worst order ratio ⋮ Measuring the problem-relevant information in input ⋮ The relative worst-order ratio applied to paging ⋮ A theoretical comparison of LRU and LRU-K ⋮ A new variable-sized bin packing problem ⋮ List factoring and relative worst order analysis ⋮ Random-order bin packing ⋮ Scheduling jobs on grid processors ⋮ The maximum resource bin packing problem ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ List Update with Locality of Reference
This page was built for publication:
