受强制性开放获取政策约束的文章 - Siddharth Prasad了解详情
可在其他位置公开访问的文章：7 篇
Sample complexity of tree search configuration: Cutting planes and beyond
MF Balcan, S Prasad, T Sandholm, E Vitercik
Advances in Neural Information Processing Systems 34, 4015-4027, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense
Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts
MFF Balcan, S Prasad, T Sandholm, E Vitercik
Advances in Neural Information Processing Systems 35, 33890-33903, 2022
强制性开放获取政策： US National Science Foundation, US Department of Defense
Improved sample complexity bounds for branch-and-cut
MF Balcan, S Prasad, T Sandholm, E Vitercik
arXiv preprint arXiv:2111.11207, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense
Efficient algorithms for learning revenue-maximizing two-part tariffs
MF Balcan, S Prasad, T Sandholm
Proceedings of the Twenty-Ninth International Joint Conference on Artificial …, 2020
强制性开放获取政策： US National Science Foundation, US Department of Defense
Bicriteria Multidimensional Mechanism Design with Side Information
MF Balcan, S Prasad, T Sandholm
Thirty-seventh Conference on Neural Information Processing Systems, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense
Learning Within an Instance for Designing High-Revenue Combinatorial Auctions
MF Balcan, S Prasad, T Sandholm
IJCAI, 31-37, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense
Maximizing Revenue under Market Shrinkage and Market Uncertainty
MF Balcan, S Prasad, T Sandholm
Advances in Neural Information Processing Systems 35, 1643-1655, 2022
强制性开放获取政策： US National Science Foundation, US Department of Defense
出版信息和资助信息由计算机程序自动确定