年別の研究成果
年別の研究成果
研究成果
検索結果
-
2019
Improved regret bounds for bandit combinatorial optimization
Ito, S., Hatano, D., Sumita, H., Takemura, K., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2019, In: Advances in Neural Information Processing Systems. 32研究成果: Conference article › 査読
1 被引用数 (Scopus) -
Oracle-efficient algorithms for online linear optimization with bandit feedback
Ito, S., Hatano, D., Sumita, H., Takemura, K., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2019, In: Advances in Neural Information Processing Systems. 32研究成果: Conference article › 査読
1 被引用数 (Scopus) -
2018
Regret bounds for online portfolio selection with a cardinality constraint
Ito, S., Hatano, D., Sumita, H., Yabe, A., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2018 1 1, In: Advances in Neural Information Processing Systems. 2018-December, p. 10588-10597 10 p.研究成果: Conference article › 査読
2 被引用数 (Scopus) -
2017
Efficient sublinear-regret algorithms for online sparse linear regression with limited observation
Ito, S., Hatano, D., Sumita, H., Yabe, A., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2017 1 1, In: Advances in Neural Information Processing Systems. 2017-December, p. 4100-4109 10 p.研究成果: Conference article › 査読
1 被引用数 (Scopus) -
2005
Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems
Moriya, K. & Nodera, T., 2005, In: Lecture Notes in Computer Science. 3483, IV, p. 978-988 11 p.研究成果: Conference article › 査読
2 被引用数 (Scopus) -
2002
Choice number of some complete multi-partite graphs
Enomoto, H., Ohba, K., Ota, K. & Sakamoto, J., 2002 2 6, In: Discrete Mathematics. 244, 1-3, p. 55-66 12 p.研究成果: Conference article › 査読
Open Access20 被引用数 (Scopus) -
2000
Graph decompositions and D3-paths with a prescribed endvertex
Enomoto, H., Matsunaga, S. & Katsuhiro, O., 2000 2 28, In: Discrete Mathematics. 213, 1-3, p. 87-104 18 p.研究成果: Conference article › 査読
Open Access1 被引用数 (Scopus)