Online Prediction over Permutahedron
スポンサーリンク
概要
- 論文の詳細を見る
We consider an online prediction problem where the player is supposed to predict a permutation of n fixed objects at each trial. This problem is motivated by a scheduling problem whose objective is to minimize the sum of waiting times of n sequential tasks. We propose an online prediction algorithm which predicts almost as well as the best fixed permutation in hindsight.
- 一般社団法人情報処理学会の論文
- 2011-02-28
著者
-
Masayuki Takeda
Department Of Informatics Kyushu University
-
Shota Yasutake
Department of Informatics, Kyushu University.
-
Kohei Hatano
Department of Informatics, Kyushu University.
-
Shuji Kijima
Department of Informatics, Kyushu University.
-
Eiji Takimoto
Department of Informatics, Kyushu University.
-
Eiji Takimoto
Department Of Informatics Kyushu University.
-
Kohei Hatano
Department Of Informatics Kyushu University.
-
Shuji Kijima
Graduate School Of Information Science And Electrical Engineering Kyushu University
-
Shota Yasutake
Department Of Informatics Kyushu University.
関連論文
- Variable Length Don't-Care Pattern Matching Problems on Compressed Texts
- Online Prediction over Permutahedron
- 圧縮テキスト上でのq-gram非重複頻度の効率的な計算とその応用
- Approximating the path-distance-width for k-cocomparability graphs
- On Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on Three-interaction