Pages that link to "Item:Q4302787"
From MaRDI portal
The following pages link to An optimal on-line algorithm for metrical task system (Q4302787):
Displaying 50 items.
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Online computation with advice (Q541670) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Shortest paths without a map (Q809612) (← links)
- On multi-threaded metrical task systems (Q849631) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Online chasing problems for regular polygons (Q975435) (← links)
- Randomized algorithms for metrical task systems (Q1127546) (← links)
- Unfair problems and randomized algorithms for metrical task systems (Q1283826) (← links)
- On the power of randomization in on-line algorithms (Q1312184) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← 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)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- On algorithm design for metrical task systems (Q1361412) (← links)
- On-line learning and the metrical task system problem (Q1568389) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- Optimal online algorithms for an electronic commerce money distribution system (Q1600989) (← links)
- The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
- On randomization in on-line computation. (Q1854274) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
- Randomized online computation with high probability guarantees (Q2134747) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- Paging with request sets (Q2272199) (← links)
- Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
- The online \(k\)-server problem with rejection (Q2339820) (← links)
- On online algorithms with advice for the \(k\)-server problem (Q2344207) (← links)
- Uniform metrical task systems with a limited number of states (Q2380010) (← links)
- Competitive analysis for the on-line truck transportation problem (Q2494309) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- How to whack moles (Q2503357) (← links)
- Topology matters: smoothed competitiveness of metrical task systems (Q2566010) (← links)
- Unified algorithms for online learning and competitive analysis (Q2806821) (← links)
- A Combinatorial Metrical Task System Problem Under the Uniform Metric (Q2831385) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Nearly Optimal Competitive Online Replacement Policies (Q4385163) (← links)
- Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing (Q4685726) (← links)
- Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing (Q4994985) (← links)
- Randomized online multi-threaded paging (Q5054862) (← links)
- Randomized algorithms for metrical task systems (Q5057430) (← links)
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations (Q5066876) (← links)
- Better Bounds for Online Line Chasing (Q5092366) (← links)
- On-line scheduling with hard deadlines (Q5096944) (← links)
