Pages that link to "Item:Q3485852"

The following pages link to Competitive algorithms for server problems (Q3485852):

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)
• On-line algorithms for the dominating set problem (Q290186) (← links)
• Uniform multipaging reduces to paging (Q293296) (← links)
• A simple analysis of the harmonic algorithm for two servers (Q294802) (← links)
• A fast work function algorithm for solving the \(k\)-server problem (Q300972) (← links)
• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem (Q301952) (← links)
• The \(k\)-server problem (Q458484) (← links)
• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
• A comparison of performance measures for online algorithms (Q494791) (← links)
• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• Online computation with advice (Q541670) (← links)
• A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
• Competitive strategy for on-line leasing of depreciable equipment (Q646109) (← links)
• SIMPLE: An optimal disk system with two restricted heads (Q672661) (← links)
• Geometric two-server algorithms (Q673915) (← links)
• Of robot ants and elephants: a computational comparison (Q719319) (← links)
• A strongly competitive randomized paging algorithm (Q808246) (← links)
• Online \(k\)-server routing problems (Q839628) (← links)
• On multi-threaded metrical task systems (Q849631) (← links)
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
• An on-line multi-CBR agent dispatching algorithm (Q855211) (← links)
• On the remote server problem or more about TCP acknowledgments (Q861268) (← links)
• The minimum backlog problem (Q888427) (← links)
• R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
• On metric clustering to minimize the sum of radii (Q970610) (← links)
• Online chasing problems for regular polygons (Q975435) (← links)
• Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
• Randomized algorithms for metrical task systems (Q1127546) (← links)
• A note on the server problem and a benevolent adversary (Q1178219) (← links)
• HARMONIC is 3-competitive for two servers (Q1193886) (← links)
• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936) (← links)
• The online graph bandwidth problem (Q1198951) (← links)
• The weighted list update problem and the lazy adversary (Q1208728) (← links)
• The combinatorics of effective resistances and resistive inverses (Q1281506) (← links)
• Unfair problems and randomized algorithms for metrical task systems (Q1283826) (← links)
• On the power of randomization in on-line algorithms (Q1312184) (← links)
• On-line algorithms for locating checkpoints (Q1312186) (← links)
• A new measure for the study of on-line algorithms (Q1312188) (← links)
• On lookahead in the list update problem (Q1322123) (← links)
• Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
• A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
• Lower bounds for on-line graph coloring (Q1331951) (← links)
• The list update problem and the retrieval of sets (Q1331955) (← links)
• A lower bound for two-server balancing algorithms (Q1336749) (← links)
• On-line algorithms for weighted bipartite matching and stable marriages (Q1342235) (← links)
• The 2-evader problem (Q1351604) (← links)
• Distributed near-optimal matching (Q1375630) (← links)
• Paging more than one page (Q1391298) (← links)
• More on randomized on-line algorithms for caching. (Q1401208) (← links)