• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the AAAI Conference on Artificial Intelligence, 36 /

No. 9: AAAI-22 Technical Tracks 9

AAAI Technical Track on Multiagent Systems

  • Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs

    Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen

    9360-9367

    PDF
  • Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search

    Taoan Huang, Jiaoyang Li, Sven Koenig, Bistra Dilkina

    9368-9376

    PDF
  • MDPGT: Momentum-Based Decentralized Policy Gradient Tracking

    Zhanhong Jiang, Xian Yeow Lee, Sin Yong Tan, Kai Liang Tan, Aditya Balu, Young M Lee, Chinmay Hegde, Soumik Sarkar

    9377-9385

    PDF
  • Shard Systems: Scalable, Robust and Persistent Multi-Agent Path Finding with Performance Guarantees

    Christopher Leet, Jiaoyang Li, Sven Koenig

    9386-9395

    PDF
  • A Deeper Understanding of State-Based Critics in Multi-Agent Reinforcement Learning

    Xueguang Lyu, Andrea Baisero, Yuchen Xiao, Christopher Amato

    9396-9404

    PDF
  • When Can the Defender Effectively Deceive Attackers in Security Games?

    Thanh Nguyen, Haifeng Xu

    9405-9412

    PDF
  • Generalization in Mean Field Games by Learning Master Policies

    Sarah Perrin, Mathieu Laurière, Julien Pérolat, Romuald Élie, Matthieu Geist, Olivier Pietquin

    9413-9421

    PDF
  • Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics

    Zirou Qiu, Chen Chen, Madhav Marathe, S.S. Ravi, Daniel J. Rosenkrantz, Richard Stearns, Anil Vullikanti

    9422-9430

    PDF
  • How Many Representatives Do We Need? The Optimal Size of a Congress Voting on Binary Issues

    Manon Revel, Tao Lin, Daniel Halpern

    9431-9438

    PDF
  • Decentralized Mean Field Games

    Sriram Ganapathi Subramanian, Matthew E. Taylor, Mark Crowley, Pascal Poupart

    9439-9447

    PDF
  • Incentivizing Collaboration in Machine Learning via Synthetic Data Rewards

    Sebastian Shenghong Tay, Xinyi Xu, Chuan Sheng Foo, Bryan Kian Hsiang Low

    9448-9456

    PDF
  • Learning the Optimal Recommendation from Explorative Users

    Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, Haifeng Xu

    9457-9465

    PDF
  • Multi-Agent Incentive Communication via Decentralized Teammate Modeling

    Lei Yuan, Jianhao Wang, Fuxiang Zhang, Chenghe Wang, ZongZhang Zhang, Yang Yu, Chongjie Zhang

    9466-9474

    PDF
  • MLink: Linking Black-Box Models for Collaborative Multi-Model Inference

    Mu Yuan, Lan Zhang, Xiang-Yang Li

    9475-9483

    PDF
  • Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization

    Hugh Zhang, Adam Lerer, Noam Brown

    9484-9492

    PDF
  • Hedonic Games with Fixed-Size Coalitions

    Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli

    9287-9295

    PDF
  • Partner-Aware Algorithms in Decentralized Cooperative Bandit Teams

    Erdem Biyik, Anusha Lalitha, Rajarshi Saha, Andrea Goldsmith, Dorsa Sadigh

    9296-9303

    PDF
  • Fixation Maximization in the Positional Moran Process

    Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis, Asger Ullersted Rasmussen, Josef Tkadlec

    9304-9312

    PDF
  • Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding

    Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig

    9313-9322

    PDF
  • Participatory Budgeting with Donations and Diversity Constraints

    Jiehua Chen, Martin Lackner, Jan Maly

    9323-9330

    PDF
  • Pretrained Cost Model for Distributed Constraint Optimization Problems

    Yanchen Deng, Shufeng Kong, Bo An

    9331-9340

    PDF
  • Concentration Network for Reinforcement Learning of Large-Scale Multi-Agent Systems

    Qingxu Fu, Tenghai Qiu, Jianqiang Yi, Zhiqiang Pu, Shiguang Wu

    9341-9349

    PDF
  • Cooperative Multi-Agent Fairness and Equivariant Policies

    Niko A. Grupen, Bart Selman, Daniel D. Lee

    9350-9359

    PDF

AAAI Technical Track on Philosophy and Ethics of AI

  • Algorithmic Fairness Verification with Graphical Models

    Bishwamittra Ghosh, Debabrota Basu, Kuldeep S Meel

    9539-9548

    PDF
  • Achieving Long-Term Fairness in Sequential Decision Making

    Yaowei Hu, Lu Zhang

    9549-9557

    PDF
  • Fairness without Imputation: A Decision Tree Approach for Fair Prediction with Missing Values

    Haewon Jeong, Hao Wang, Flavio P. Calmon

    9558-9566

    PDF
  • Shaping Noise for Robust Attributions in Neural Stochastic Differential Equations

    Sumit Kumar Jha, Rickard Ewetz, Alvaro Velasquez, Arvind Ramanathan, Susmit Jha

    9567-9574

    PDF
  • Certified Robustness of Nearest Neighbors against Data Poisoning and Backdoor Attacks

    Jinyuan Jia, Yupei Liu, Xiaoyu Cao, Neil Zhenqiang Gong

    9575-9583

    PDF
  • On the Fairness of Causal Algorithmic Recourse

    Julius von Kügelgen, Amir-Hossein Karimi, Umang Bhatt, Isabel Valera, Adrian Weller, Bernhard Schölkopf

    9584-9594

    PDF
  • DeepAuth: A DNN Authentication Framework by Model-Unique and Fragile Signature Embedding

    Yingjie Lao, Weijie Zhao, Peng Yang, Ping Li

    9595-9603

    PDF
  • Fast Sparse Decision Tree Optimization via Reference Ensembles

    Hayden McTavish, Chudi Zhong, Reto Achermann, Ilias Karimalis, Jacques Chen, Cynthia Rudin, Margo Seltzer

    9604-9613

    PDF
  • Unsupervised Causal Binary Concepts Discovery with VAE for Black-Box Model Explanation

    Thien Q Tran, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma

    9614-9622

    PDF
  • Do Feature Attribution Methods Correctly Attribute Features?

    Yilun Zhou, Serena Booth, Marco Tulio Ribeiro, Julie Shah

    9623-9633

    PDF
  • Why Fair Labels Can Yield Unfair Predictions: Graphical Conditions for Introduced Unfairness

    Carolyn Ashurst, Ryan Carey, Silvia Chiappa, Tom Everitt

    9494-9503

    PDF
  • Incorporating Item Frequency for Differentially Private Set Union

    Ricardo Silva Carvalho, Ke Wang, Lovedeep Singh Gondara

    9504-9511

    PDF
  • Cosine Model Watermarking against Ensemble Distillation

    Laurent Charette, Lingyang Chu, Yizhou Chen, Jian Pei, Lanjun Wang, Yong Zhang

    9512-9520

    PDF
  • Towards Debiasing DNN Models from Spurious Feature Influence

    Mengnan Du, Ruixiang Tang, Weijie Fu, Xia Hu

    9521-9528

    PDF
  • Path-Specific Objectives for Safer Agent Incentives

    Sebastian Farquhar, Ryan Carey, Tom Everitt

    9529-9538

    PDF

AAAI Technical Track on Planning, Routing, and Scheduling

  • Formula Synthesis in Propositional Dynamic Logic with Shuffle

    Sophie Pinchinat, Sasha Rubin, François Schwarzentruber

    9902-9909

    PDF
  • Efficient Encoding of Cost Optimal Delete-Free Planning as SAT

    Masood Feyzbakhsh Rankooh, Jussi Rintanen

    9910-9917

    PDF
  • Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction

    Marc Rigter, Danial Dervovic, Parisa Hassanzadeh, Jason Long, Parisa Zehtabi, Daniele Magazzeni

    9918-9925

    PDF
  • Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring

    Yunzhuang Shen, Yuan Sun, Xiaodong Li, Andrew Eberhard, Andreas Ernst

    9926-9934

    PDF
  • Qubit Routing Using Graph Neural Network Aided Monte Carlo Tree Search

    Animesh Sinha, Utkarsh Azad, Harjinder Singh

    9935-9943

    PDF
  • Classical Planning with Avoid Conditions

    Marcel Steinmetz, Jörg Hoffmann, Alisa Kovtunova, Stefan Borgwardt

    9944-9952

    PDF
  • Stochastic Goal Recognition Design Problems with Suboptimal Agents

    Christabel Wayllace, William Yeoh

    9953-9961

    PDF
  • Equity Promotion in Online Resource Allocation

    Pan Xu, Yifan Xu

    9962-9970

    PDF
  • Efficient Device Scheduling with Multi-Job Federated Learning

    Chendi Zhou, Ji Liu, Juncheng Jia, Jingbo Zhou, Yang Zhou, Huaiyu Dai, Dejing Dou

    9971-9979

    PDF
  • MAPDP: Cooperative Multi-Agent Reinforcement Learning to Solve Pickup and Delivery Problems

    Zefang Zong, Meng Zheng, Yong Li, Depeng Jin

    9980-9988

    PDF
  • Inconsistent Planning: When in Doubt, Toss a Coin!

    Yuriy Dementiev, Fedor Fomin, Artur Ignatiev

    9724-9731

    PDF
  • Robustification of Online Graph Exploration Methods

    Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter

    9732-9740

    PDF
  • Explainable Planner Selection for Classical Planning

    Patrick Ferber, Jendrik Seipp

    9741-9749

    PDF
  • Operator-Potential Heuristics for Symbolic Search

    Daniel Fišer, Álvaro Torralba, Jörg Hoffmann

    9750-9757

    PDF
  • Reconfiguring Shortest Paths in Graphs

    Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri

    9758-9766

    PDF
  • Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics

    Rostislav Horčík, Daniel Fišer, Álvaro Torralba

    9767-9775

    PDF
  • Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty

    Luke Hunsberger, Roberto Posenato

    9776-9785

    PDF
  • Learning to Solve Routing Problems via Distributionally Robust Optimization

    Yuan Jiang, Yaoxin Wu, Zhiguang Cao, Jie Zhang

    9786-9794

    PDF
  • Learning Probably Approximately Complete and Safe Action Models for Stochastic Worlds

    Brendan Juba, Roni Stern

    9795-9804

    PDF
  • Bounding Quality in Diverse Planning

    Michael Katz, Shirin Sohrabi, Octavian Udrea

    9805-9812

    PDF
  • A* Search and Bound-Sensitive Heuristics for Oversubscription Planning

    Michael Katz, Emil Keyder

    9813-9820

    PDF
  • NICE: Robust Scheduling through Reinforcement Learning-Guided Integer Programming

    Luke Kenworthy, Siddharth Nayak, Christopher Chin, Hamsa Balakrishnan

    9821-9829

    PDF
  • Planning to Avoid Side Effects

    Toryn Q. Klassen, Sheila A. McIlraith, Christian Muise, Jarvis Xu

    9830-9839

    PDF
  • Sample-Efficient Iterative Lower Bound Optimization of Deep Reactive Policies for Planning in Continuous MDPs

    Siow Meng Low, Akshat Kumar, Scott Sanner

    9840-9848

    PDF
  • Bridging LTLf Inference to GNN Inference for Learning LTLf Formulae

    Weilin Luo, Pingjia Liang, Jianfeng Du, Hai Wan, Bo Peng, Delong Zhang

    9849-9857

    PDF
  • Risk-Aware Stochastic Shortest Path

    Tobias Meggendorfer

    9858-9867

    PDF
  • Differential Assessment of Black-Box AI Agents

    Rashmeet Kaur Nayyar, Pulkit Verma, Siddharth Srivastava

    9868-9876

    PDF
  • Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks

    Kevin Osanlou, Jeremy Frank, Andrei Bursuc, Tristan Cazenave, Eric Jacopin, Christophe Guettier, J. Benton

    9877-9885

    PDF
  • Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping

    Stefan Panjkovic, Andrea Micheli, Alessandro Cimatti

    9886-9893

    PDF
  • A Distributional Framework for Risk-Sensitive End-to-End Planning in Continuous MDPs

    Noah Patton, Jihwan Jeong, Mike Gimelfarb, Scott Sanner

    9894-9901

    PDF
  • Formal Semantics and Formally Verified Validation for Temporal Planning

    Mohammad Abdulaziz, Lukas Koller

    9635-9643

    PDF
  • Goal Recognition as Reinforcement Learning

    Leonardo Amado, Reuth Mirsky, Felipe Meneguzzi

    9644-9651

    PDF
  • Online Search with Best-Price and Query-Based Predictions

    Spyros Angelopoulos, Shahin Kamali, Dehou Zhang

    9652-9660

    PDF
  • Extended Goal Recognition Design with First-Order Computation Tree Logic

    Tsz-Chiu Au

    9661-9668

    PDF
  • Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise

    Thom S. Badings, Alessandro Abate, Nils Jansen, David Parker, Hasan A. Poonawala, Marielle Stoelinga

    9669-9678

    PDF
  • Synthesis from Satisficing and Temporal Goals

    Suguman Bansal, Lydia Kavraki, Moshe Y. Vardi, Andrew Wells

    9679-9686

    PDF
  • Making Translations to Classical Planning Competitive with Other HTN Planners

    Gregor Behnke, Florian Pollitt, Daniel Höller, Pascal Bercher, Ron Alford

    9687-9697

    PDF
  • PlanVerb: Domain-Independent Verbalization and Summary of Task Plans

    Gerard Canal, Senka Krivić, Paul Luff, Andrew Coles

    9698-9706

    PDF
  • Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation

    Lukáš Chrpa, Pavel Rytíř, Rostislav Horčík, Stefan Edelkamp

    9707-9715

    PDF
  • The FF Heuristic for Lifted Classical Planning

    Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès

    9716-9723

    PDF

AAAI Technical Track on Reasoning under Uncertainty

  • Identifiability of Linear AMP Chain Graph Models

    Yuhao Wang, Arnab Bhattacharyya

    10080-10089

    PDF
  • DeepStochLog: Neural Stochastic Logic Programming

    Thomas Winters, Giuseppe Marra, Robin Manhaeve, Luc De Raedt

    10090-10100

    PDF
  • Towards Robust Off-Policy Learning for Runtime Uncertainty

    Da Xu, Yuting Ye, Chuanwei Ruan, Bo Yang

    10101-10109

    PDF
  • Improving Bayesian Neural Networks by Adversarial Sampling

    Jiaru Zhang, Yang Hua, Tao Song, Hao Wang, Zhengui Xue, Ruhui Ma, Haibing Guan

    10110-10117

    PDF
  • Entropy Estimation via Normalizing Flow

    Ziqiao Ao, Jinglai Li

    9990-9998

    PDF
  • Fast and More Powerful Selective Inference for Sparse High-Order Interaction Model

    Diptesh Das, Vo Nguyen Le Duy, Hiroyuki Hanada, Koji Tsuda, Ichiro Takeuchi

    9999-10007

    PDF
  • Generalized Stochastic Matching

    Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi

    10008-10015

    PDF
  • Robust Tests in Online Decision-Making

    Gi-Soo Kim, Jane P Kim, Hyun-Joon Yang

    10016-10024

    PDF
  • Local Differential Privacy for Belief Functions

    Qiyu Li, Chunlai Zhou, Biao Qin, Zhiqiang Xu

    10025-10033

    PDF
  • A Complete Criterion for Value of Information in Soluble Influence Diagrams

    Chris van Merwijk, Ryan Carey, Tom Everitt

    10034-10041

    PDF
  • Training-Free Uncertainty Estimation for Dense Regression: Sensitivity as a Surrogate

    Lu Mi, Hao Wang, Yonglong Tian, Hao He, Nir N Shavit

    10042-10050

    PDF
  • On the Impact of Spurious Correlation for Out-of-Distribution Detection

    Yifei Ming, Hang Yin, Yixuan Li

    10051-10059

    PDF
  • Inference and Learning with Model Uncertainty in Probabilistic Logic Programs

    Victor Verreet, Vincent Derkinderen, Pedro Zuidberg Dos Martires, Luc De Raedt

    10060-10069

    PDF
  • Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions

    Yuanhong Wang, Timothy van Bremen, Yuyi Wang, Ondřej Kuželka

    10070-10079

    PDF

AAAI Technical Track on Search and Optimization

  • Local and Global Convergence of General Burer-Monteiro Tensor Optimizations

    Shuang Li, Qiuwei Li

    10266-10274

    PDF
  • Bi-CMR: Bidirectional Reinforcement Guided Hashing for Effective Cross-Modal Retrieval

    Tieying Li, Xiaochun Yang, Bin Wang, Chong Xi, Hanzhong Zheng, Xiangmin Zhou

    10275-10282

    PDF
  • Improving Local Search Algorithms via Probabilistic Configuration Checking

    Weilin Luo, Rongzhen Ye, Hai Wan, Shaowei Cai, Biqing Fang, Delong Zhang

    10283-10290

    PDF
  • PEA*+IDA*: An Improved Hybrid Memory-Restricted Algorithm

    Frederico Messa, André Grahl Pereira

    10291-10298

    PDF
  • Search Strategies for Topological Network Optimization

    Michael D. Moffitt

    10299-10308

    PDF
  • Hibernated Backdoor: A Mutual Information Empowered Backdoor Attack to Deep Neural Networks

    Rui Ning, Jiang Li, Chunsheng Xin, Hongyi Wu, Chonggang Wang

    10309-10318

    PDF
  • Planning with Explanations for Finding Desired Meeting Points on Graphs

    Keisuke Otaki

    10319-10326

    PDF
  • A Fast Local Search Algorithm for the Latin Square Completion Problem

    Shiwei Pan, Yiyuan Wang, Minghao Yin

    10327-10335

    PDF
  • Sparsification of Decomposable Submodular Functions

    Akbar Rafiey, Yuichi Yoshida

    10336-10344

    PDF
  • Subset Approximation of Pareto Regions with Bi-objective A*

    Nicolás Rivera, Jorge A. Baier, Carlos Hernández

    10345-10352

    PDF
  • On Probabilistic Generalization of Backdoors in Boolean Satisfiability

    Alexander Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov

    10353-10361

    PDF
  • A Novel Approach to Solving Goal-Achieving Problems for Board Games

    Chung-Chin Shih, Ti-Rong Wu, Ting Han Wei, I-Chen Wu

    10362-10369

    PDF
  • Machine Learning for Online Algorithm Selection under Censored Feedback

    Alexander Tornede, Viktor Bengs, Eyke Hüllermeier

    10370-10380

    PDF
  • Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback

    Junxiong Wang, Debabrota Basu, Immanuel Trummer

    10381-10390

    PDF
  • DPCD: Discrete Principal Coordinate Descent for Binary Variable Problems

    Huan Xiong

    10391-10398

    PDF
  • Optimize What You Evaluate With: Search Result Diversification Based on Metric Optimization

    Hai-Tao Yu

    10399-10407

    PDF
  • A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II)

    Weijie Zheng, Yufei Liu, Benjamin Doerr

    10408-10416

    PDF
  • Efficient Optimal Transport Algorithm by Accelerated Gradient Descent

    Dongsheng An, Na Lei, Xiaoyin Xu, Xianfeng Gu

    10119-10128

    PDF
  • Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems

    Yingjie Bi, Haixiang Zhang, Javad Lavaei

    10129-10137

    PDF
  • A*+BFHS: A Hybrid Heuristic Search Algorithm

    Zhaoxing Bu, Richard E. Korf

    10138-10145

    PDF
  • NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem

    Jiejiang Chen, Yiyuan Wang, Shaowei Cai, Minghao Yin, Yupeng Zhou, Jieyu Wu

    10146-10155

    PDF
  • Fourier Representations for Black-Box Optimization over Categorical Variables

    Hamid Dadkhahi, Jesus Rios, Karthikeyan Shanmugam, Payel Das

    10156-10165

    PDF
  • New Results in Bounded-Suboptimal Search

    Maximilian Fickert, Tianyi Gu, Wheeler Ruml

    10166-10173

    PDF
  • An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs

    Jian Gao, Zhenghang Xu, Ruizhi Li, Minghao Yin

    10174-10183

    PDF
  • Learning from Mistakes – a Framework for Neural Architecture Search

    Bhanu Garg, Li Zhang, Pradyumna Sridhara, Ramtin Hosseini, Eric Xing, Pengtao Xie

    10184-10192

    PDF
  • The Complexity of Temporal Vertex Cover in Small-Degree Graphs

    Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis

    10193-10201

    PDF
  • Provable Sensor Sets for Epidemic Detection over Networks with Minimum Delay

    Jack Heavey, Jiaming Cui, Chen Chen, B. Aditya Prakash, Anil Vullikanti

    10202-10209

    PDF
  • Towards Automated Discovery of God-Like Folk Algorithms for Rubik’s Cube

    Garrett E. Katz, Naveed Tahir

    10210-10218

    PDF
  • MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers

    Elias B. Khalil, Christopher Morris, Andrea Lodi

    10219-10227

    PDF
  • Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization

    Akihiro Kishimoto, Djallel Bouneffouf, Radu Marinescu, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito Palmes, Adi Botea

    10228-10237

    PDF
  • PRISM: A Rich Class of Parameterized Submodular Information Measures for Guided Data Subset Selection

    Suraj Kothawade, Vishal Kaushal, Ganesh Ramakrishnan, Jeff Bilmes, Rishabh Iyer

    10238-10246

    PDF
  • Split Moves for Monte-Carlo Tree Search

    Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykuła, Mark H. M. Winands

    10247-10255

    PDF
  • MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search

    Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig

    10256-10265

    PDF

Primary Sidebar