( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Delay and Cooperation in Nonstochastic Linear Bandits.

, , , , , , и . NeurIPS, (2020)

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.

Takuro Yoshida

Takuro Ito

Takuro Ideguchi

 

Другие публикации лиц с тем же именем

Unranking of small combinations from large sets., , и . J. Discrete Algorithms, (2014)Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 55-64. Springer, (2009)Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands.. TAMC, том 6648 из Lecture Notes in Computer Science, стр. 428-439. Springer, (2011)Computing a Tree Having a Small Vertex Cover., и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 77-91. Springer, (2016)Approximating a Generalization of Metric TSP., и . IEICE Trans. Inf. Syst., 90-D (2): 432-439 (2007)Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform., , , и . PDP, стр. 67-71. IEEE, (2020)Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs.. Algorithmica, 80 (11): 3270-3292 (2018)"Rent-or-Buy" Scheduling and Cost Coloring Problems., , и . FSTTCS, том 4855 из Lecture Notes in Computer Science, стр. 84-95. Springer, (2007)Network Design with Weighted Degree Constraints., и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 214-225. Springer, (2009)LP-based pivoting algorithm for higher-order correlation clustering.. J. Comb. Optim., 37 (4): 1312-1326 (2019)