4 search results - page 1 / 1 » The relative worst-order ratio applied to paging |
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
JCO
2006
13 years 4 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
JCSS
2007
13 years 4 months ago
2007
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
ACTA
2010
12 years 11 months ago
2010
The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently ...