Papers
Knowledge-Guided Agent-Tactic-Aware Learning for StarCraft Micromanagement
Yue Hu, Juntao Li, Xi Li et al.
Best-Case and Worst-Case Behavior of Greedy Best-First Search
Manuel Heusner, Thomas Keller, Malte Helmert
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
Longkun Guo, Yunyun Deng, Kewen Liao et al.
An Exact Algorithm for Maximum k-Plexes in Massive Graphs
Jian Gao, Jiejiang Chen, Minghao Yin et al.
Neural Networks for Predicting Algorithm Runtime Distributions
Katharina Eggensperger, Marius Lindauer, Frank Hutter
Anytime Focal Search with Applications
Liron Cohen, Matias Greco, Hang Ma et al.
The FastMap Algorithm for Shortest Path Computations
Liron Cohen, Tansel Uras, Shiva Jahangiri et al.
Back to Basics: Benchmarking Canonical Evolution Strategies for Playing Atari
Patryk Chrabąszcz, Ilya Loshchilov, Frank Hutter
Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies
Shaowei Cai, Wenying Hou, Jinkun Lin et al.
A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms
Chao Bian, Chao Qian, Ke Tang
A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint
Xizhe Zhang, Qian Li, Weixiong Zhang
A Reactive Strategy for High-Level Consistency During Search
Robert J. Woodward, Berthe Y. Choueiry, Christian Bessiere
Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets
Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus
Stratification for Constraint-Based Multi-Objective Combinatorial Optimization
Miguel Terra-Neves, Inês Lynce, Vasco Manquinho
Accelerated Difference of Convex functions Algorithm and its Application to Sparse Binary Logistic Regression
Duy Nhat Phan, Hoai Minh Le, Hoai An Le Thi
Learning Optimal Decision Trees with SAT
Nina Narodytska, Alexey Ignatiev, Filipe Pereira et al.
Core-Guided Minimal Correction Set and Core Enumeration
Nina Narodytska, Nikolaj Bjørner, Maria-Cristina Marinescu et al.
Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT
Zhendong Lei, Shaowei Cai
Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection
Nian-Ze Lee, Yen-Shi Wang, Jie-Hong R. Jiang
DMC: A Distributed Model Counter
Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks
Luke Hunsberger, Roberto Posenato
Conflict Directed Clause Learning for Maximum Weighted Clique Problem
Emmanuel Hebrard, George Katsirelos
Boosting MCSes Enumeration
Éric Grégoire, Yacine Izza, Jean-Marie Lagniez
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht et al.
Divide and Conquer: Towards Faster Pseudo-Boolean Solving
Jan Elffers, Jakob Nordström