( en | de | ru )

 

Disambiguation of "Fukunaga, Takuro"

Author of the publication

copydeleteadd this publication to your clipboard
Online Task Assignment Problems with Reusable Resources.

, , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Takuro Yoshida

Takuro Ito

Takuro Ideguchi

 

Other publications of authors with the same name

Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform., , , and . PDP, page 67-71. IEEE, (2020)Approximating a Generalization of Metric TSP., and . IEICE Trans. Inf. Syst., 90-D (2): 432-439 (2007)Computing a Tree Having a Small Vertex Cover., and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 77-91. Springer, (2016)Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands.. TAMC, volume 6648 of Lecture Notes in Computer Science, page 428-439. Springer, (2011)Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 55-64. Springer, (2009)Unranking of small combinations from large sets., , and . J. Discrete Algorithms, (2014)Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions., , , , , , and . AAAI, page 9791-9798. AAAI Press, (2021)Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling., , , and . AAAI, page 1992-1999. AAAI Press, (2017)Improved Regret Bounds for Bandit Combinatorial Optimization., , , , , , and . NeurIPS, page 12027-12036. (2019)Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback., , , , , , and . NeurIPS, page 10589-10598. (2019)