35 search results - page 1 / 7 » A Competitive Analysis of the List Update Problem with Looka... |
MFCS
1994
Springer
13 years 8 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
TCS
2008
13 years 4 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
AIPS
2004
13 years 6 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algori...
SIAMCOMP
2012
11 years 7 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...