Pages that link to "Item:Q808246"

The following pages link to A strongly competitive randomized paging algorithm (Q808246):

Displaying 50 items.

• A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
• The working set algorithm has competitive ratio less than two (Q287173) (← links)
• Uniform multipaging reduces to paging (Q293296) (← links)
• Improved integer linear programming formulations for the job sequencing and tool switching problem (Q319452) (← links)
• The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
• On multi-threaded metrical task systems (Q849631) (← links)
• The relative worst-order ratio applied to paging (Q881599) (← links)
• Paging with connections: FIFO strikes again (Q884462) (← links)
• Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
• On competitive on-line paging with lookahead (Q1276313) (← links)
• Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
• On the power of randomization in on-line algorithms (Q1312184) (← 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)
• Scheduling with resource management in manufacturing systems (Q1331541) (← links)
• Competitive algorithms for the weighted server problem (Q1331957) (← links)
• Paging more than one page (Q1391298) (← links)
• More on randomized on-line algorithms for caching. (Q1401208) (← links)
• Connection caching: Model and algorithms. (Q1401982) (← links)
• Competitive analysis of randomized paging algorithms (Q1575677) (← links)
• Trackless online algorithms for the server problem (Q1607049) (← links)
• Improved heuristic algorithms for the job sequencing and tool switching problem (Q1651541) (← links)
• A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
• On the smoothness of paging algorithms (Q1743122) (← links)
• The \(k\)-resource problem in uniform metric spaces (Q1758162) (← links)
• A randomized algorithm for two servers on the line. (Q1854341) (← links)
• A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
• Online companion caching (Q1887084) (← links)
• Combining request scheduling with web caching (Q1887085) (← links)
• Competitive caching of query results in search engines (Q1887088) (← links)
• The weighted 2-server problem (Q1887090) (← links)
• A proof of the optimality of the MIN paging algorithm using linear programming duality (Q1924620) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
• Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
• The worst page-replacement policy (Q2272194) (← links)
• Paging with request sets (Q2272199) (← links)
• Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
• Online file caching with rejection penalties (Q2346958) (← links)
• Analysis of simple randomized buffer management for parallel I/O (Q2390215) (← links)
• General caching is hard: even with small pages (Q2408914) (← links)
• Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
• Engineering Efficient Paging Algorithms (Q2828192) (← links)
• On Variants of File Caching (Q3012805) (← links)
• Object Caching for Queries and Updates (Q3605515) (← links)
• Randomized online multi-threaded paging (Q5054862) (← links)
• Paging more than one page (Q5096338) (← links)
• Dynamic Balanced Graph Partitioning (Q5130579) (← links)