Pages that link to "Item:Q3541083"
From MaRDI portal
The following pages link to Randomized Competitive Analysis for Two-Server Problems (Q3541083):
Displaying 14 items.
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- Server problems and resistive spaces (Q751278) (← links)
- Randomized algorithms for online bounded bidding (Q763539) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- A decomposition theorem for task systems and bounds for randomized server problems (Q2706128) (← links)
- (Q4449208) (← links)
- (Q4763407) (← links)