A combinatorial metrical task system problem under the uniform metric
From MaRDI portal
(Redirected from Publication:2831385)
Recommendations
Cites work
- 10.1162/1532443041424328
- A decision-theoretic generalization of on-line learning and an application to boosting
- A polylogarithmic-competitive algorithm for the k-server problem
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A regularization approach to metrical task systems
- An optimal on-line algorithm for metrical task system
- Bandit online optimization over the permutahedron
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Changing bases: multistage optimization for matroids and matchings
- Combinatorial bandits
- Efficient algorithms for online decision problems
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1559591 (Why is no real title available?)
- scientific article; zbMATH DE number 2119638 (Why is no real title available?)
- On the k -server conjecture
- Randomized algorithms for metrical task systems
- Unified algorithms for online learning and competitive analysis
This page was built for publication: A combinatorial metrical task system problem under the uniform metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831385)