From post

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.

 

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

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts., , , и . Algorithmica, 82 (1): 64-87 (2020)Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare., , , , , и . WINE, том 11920 из Lecture Notes in Computer Science, стр. 129-141. Springer, (2019)Algorithms to Approximate Column-Sparse Packing Problems., , , и . CoRR, (2017)Online Resource Allocation with Matching Constraints., , , , , и . AAMAS, стр. 1681-1689. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Sequential Decision Making with Limited Resources.. University of Maryland, College Park, MD, USA, (2019)base-search.net (ftunivmaryland:oai:drum.lib.umd.edu:1903/25039).Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals., , , und . AAMAS, Seite 318-326. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Adversarial Bandits with Knapsacks., , , und . CoRR, (2018)The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent., , , , und . CoRR, (2019)New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching., , , und . ESA, Volume 57 von LIPIcs, Seite 24:1-24:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Algorithms to Approximate Column-sparse Packing Problems., , , und . ACM Trans. Algorithms, 16 (1): 10:1-10:32 (2020)