Pages that link to "Item:Q1329151"

The following pages link to Competitive \(k\)-server algorithms (Q1329151):

Displaying 30 items.

• The \(k\)-server problem (Q458484) (← links)
• Server problems and resistive spaces (Q751278) (← links)
• The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
• A competitive 2-server algorithm (Q1182124) (← links)
• On convex body chasing (Q1207798) (← links)
• On the power of randomization in on-line algorithms (Q1312184) (← links)
• Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
• A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
• Competitive algorithms for the weighted server problem (Q1331957) (← links)
• On the competitiveness of the move-to-front rule (Q1575556) (← links)
• Randomized competitive analysis for two server problems (Q1662430) (← links)
• A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
• The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
• On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093) (← links)
• The CNN problem and other \(k\)-server variants (Q1887095) (← links)
• Lower bounds for searching robots, some faulty (Q1981629) (← links)
• Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
• Metrical service systems with multiple servers (Q2258084) (← links)
• The online \(k\)-server problem with max-distance objective (Q2344003) (← links)
• (Q4010307) (← links)
• On the <i>k</i> -server conjecture (Q4369887) (← links)
• (Q4449208) (← links)
• (Q4763407) (← links)
• Multi-Finger Binary Search Trees (Q5091047) (← links)
• A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem (Q5505679) (← links)
• Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5918418) (← links)
• Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5925636) (← links)
• Dynamic location problems with limited look-ahead (Q5941730) (← links)
• Secretary and online matching problems with machine learned advice (Q6108930) (← links)
• Competitive analysis of on-line disk scheduling (Q6487455) (← links)