WEKO3
-
RootNode
アイテム
Online Prediction over Permutahedron
https://ipsj.ixsq.nii.ac.jp/records/72915
https://ipsj.ixsq.nii.ac.jp/records/729155f37e925-6ccf-4c03-b6fd-789f568084db
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2011 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | SIG Technical Reports(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2011-02-28 | |||||||
タイトル | ||||||||
タイトル | Online Prediction over Permutahedron | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Online Prediction over Permutahedron | |||||||
言語 | ||||||||
言語 | eng | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
資源タイプ | technical report | |||||||
著者所属 | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属 | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属 | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属 | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属 | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Informatics, Kyushu University. | ||||||||
著者名 |
Shota, Yasutake
Kohei, Hatano
Shuji, Kijima
Eiji, Takimoto
Masayuki, Takeda
× Shota, Yasutake Kohei, Hatano Shuji, Kijima Eiji, Takimoto Masayuki, Takeda
|
|||||||
著者名(英) |
Shota, Yasutake
Kohei, Hatano
Shuji, Kijima
Eiji, Takimoto
Masayuki, Takeda
× Shota, Yasutake Kohei, Hatano Shuji, Kijima Eiji, Takimoto Masayuki, Takeda
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | 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. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | 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. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AN1009593X | |||||||
書誌情報 |
研究報告アルゴリズム(AL) 巻 2011-AL-134, 号 12, p. 1-8, 発行日 2011-02-28 |
|||||||
Notice | ||||||||
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |