Search

Search Results

• Probabilistic Dependency Graphs

  Oliver Richardson, Joseph Y Halpern

  12174-12181

  2021-05-18

• Robust Contextual Bandits via Bootstrapping

  Qiao Tang, Hong Xie, Yunni Xia, Jia Lee, Qingsheng Zhu

  12182-12189

  2021-05-18

• Learning the Parameters of Bayesian Networks from Uncertain Data

  Segev Wasserkrug, Radu Marinescu, Sergey Zeltyn, Evgeny Shindin, Yishai A Feldman

  12190-12197

  2021-05-18

• Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs

  Marcel Wienöbst, Max Bannach, Maciej Liskiewicz

  12198-12206

  2021-05-18

• Bounding Causal Effects on Continuous Outcome

  Junzhe Zhang, Elias Bareinboim

  12207-12215

  2021-05-18

• A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem

  Saman Ahmadi, Guido Tack, Daniel D. Harabor, Philip Kilby

  12217-12224

  2021-05-18

• Generalization in Portfolio-Based Algorithm Selection

  Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

  12225-12232

  2021-05-18

• Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization

  Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny

  12233-12240

  2021-05-18

• f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search

  Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel D. Harabor, Peter J. Stuckey, Sven Koenig

  12241-12248

  2021-05-18

• Parameterized Algorithms for MILPs with Small Treedepth

  Cornelius Brand, Martin Koutecký, Sebastian Ordyniak

  12249-12257

  2021-05-18

• NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem

  Jiejiang Chen, Shaowei Cai, Shiwei Pan, Yiyuan Wang, Qingwei Lin, Mengyu Zhao, Minghao Yin

  12258-12266

  2021-05-18

• Symmetry Breaking for k-Robust Multi-Agent Path Finding

  Zhe Chen, Daniel D. Harabor, Jiaoyang Li, Peter J. Stuckey

  12267-12274

  2021-05-18

• Escaping Local Optima with Non-Elitist Evolutionary Algorithms

  Duc-Cuong Dang, Anton Eremeev, Per Kristian Lehre

  12275-12283

  2021-05-18

• Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints

  Anh Viet Do, Frank Neumann

  12284-12292

  2021-05-18

• Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives

  Benjamin Doerr, Weijie Zheng

  12293-12301

  2021-05-18

• Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee

  Chao Feng, Chao Qian

  12302-12310

  2021-05-18

• Choosing the Initial State for Online Replanning

  Maximilian Fickert, Ivan Gavran, Ivan Fedotov, Jörg Hoffmann, Rupak Majumdar, Wheeler Ruml

  12311-12319

  2021-05-18

• OpEvo: An Evolutionary Method for Tensor Operator Optimization

  Xiaotian Gao, Wei Cui, Lintao Zhang, Mao Yang

  12320-12327

  2021-05-18

• Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings

  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

  12328-12335

  2021-05-18

• Enhancing Balanced Graph Edge Partition with Effective Local Search

  Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan

  12336-12343

  2021-05-18

• Submodular Span, with Applications to Conditional Data Summarization

  Lilly Kumari, Jeff Bilmes

  12344-12352

  2021-05-18

• EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding

  Jiaoyang Li, Wheeler Ruml, Sven Koenig

  12353-12362

  2021-05-18

• Correlation-Aware Heuristic Search for Intelligent Virtual Machine Provisioning in Cloud Systems

  Chuan Luo, Bo Qiao, Wenqian Xing, Xin Chen, Pu Zhao, Chao Du, Randolph Yao, Hongyu Zhang, Wei Wu, Shaowei Cai, Bing He, Saravanakumar Rajmohan, Qingwei Lin

  12363-12372

  2021-05-18

• Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model

  Felix Mohr, Viktor Bengs, Eyke Hüllermeier

  12373-12381

  2021-05-18

• Policy-Guided Heuristic Search with Guarantees

  Laurent Orseau, Levi H. S. Lelis

  12382-12390

  2021-05-18