The following pages link to Competitive snoopy caching (Q1103391):
Displaying 50 items.
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- The working set algorithm has competitive ratio less than two (Q287173) (← links)
- Uniform multipaging reduces to paging (Q293296) (← links)
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- Online ordering policies for a two-product, multi-period stationary newsvendor problem (Q342475) (← links)
- Online multi-coloring on the path revisited (Q378204) (← links)
- Better bounds on online unit clustering (Q388452) (← links)
- Risk-reward models for on-line leasing of depreciable equipment (Q418310) (← links)
- Optimal randomized algorithm for a generalized ski-rental with interest rate (Q436599) (← links)
- The \(k\)-server problem (Q458484) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- Online traveling salesman problem with deadlines and service flexibility (Q498429) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- Competitive analysis for online leasing problem with compound interest rate (Q638104) (← links)
- Competitive strategy for on-line leasing of depreciable equipment (Q646109) (← links)
- Weighted online problems with advice (Q726104) (← links)
- On multi-threaded metrical task systems (Q849631) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Paging with connections: FIFO strikes again (Q884462) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Ski rental with two general options (Q975492) (← links)
- Competitive analysis of the online inventory problem (Q992666) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- Randomized online interval scheduling (Q1273096) (← links)
- Unfair problems and randomized algorithms for metrical task systems (Q1283826) (← links)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- On the power of randomization in on-line algorithms (Q1312184) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- On-line algorithms for locating checkpoints (Q1312186) (← links)
- A new measure for the study of on-line algorithms (Q1312188) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling (Q1330422) (← links)
- The list update problem and the retrieval of sets (Q1331955) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Paging more than one page (Q1391298) (← links)
- Connection caching: Model and algorithms. (Q1401982) (← links)
- More on weighted servers or FIFO is better than LRU. (Q1426456) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
