Papers
Search Strategies for Optimal Multi-Way Number Partitioning
Michael D. Moffitt
On Computing Minimal Correction Subsets
Joao Marques-Silva, Federico Heras, Mikolas Janota et al.
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz et al.
Target-Value Search Revisited
Carlos Linares López, Roni Stern, Ariel Felner
Predicting the Size of Depth-First Branch and Bound Search Trees
Levi H. S. Lelis, Lars Otten, Rina Dechter
Double-Wheel Graphs Are Graceful
Ronan Le Bras, Carla P. Gomes, Bart Selman
Monte Carlo *-Minimax Search
Marc Lanctot, Abdallah Saffidine, Joel Veness et al.
Extending Simple Tabular Reduction with Short Supports
Christopher Jefferson, Peter Nightingale
DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP
Daisuke Hatano, Katsutoshi Hirayama
Sufficiency-Based Selection Strategy for MCTS
Stefan Freyr Gudmundsson, Yngvi Björnsson
Preserving Partial Solutions while Relaxing Constraint Networks
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability
Gianluigi Greco, Francesco Scarcello
Dominance Rules for the Choquet Integral in Multiobjective Dynamic Programming
Lucie Galand, Julien Lesca, Patrice Perny
An Approach to Abductive Reasoning in Equational Logic
Mnacho Echenim, Nicolas Peltier, Sophie Tourret
Weight-Enhanced Diversification in Stochastic Local Search for Satisfiability
Thach-Thao Duong, Duc Nghia Pham, Abdul Sattar et al.
Variable Elimination in Binary CSP via Forbidden Patterns
David A. Cohen, Martin C. Cooper, Guillaume Escamocher et al.
Breaking Symmetries in Graph Representation
Michael Codish, Alice Miller, Patrick Prosser et al.
On the Complexity of Global Scheduling Constraints under Structural Restrictions
Geoffrey Chu, Serge Gaspers, Nina Narodytska et al.
A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
Yilin Cai, Zizhen Zhang, Songshan Guo et al.
Comprehensive Score: Towards Efficient Local Search for SAT with Long Clauses
Shaowei Cai, Kaile Su
On the Complexity of Trick-Taking Card Games
Édouard Bonnet, Florian Jamain, Abdallah Saffidine
Constraint Acquisition via Partial Queries
Christian Bessiere, Remi Coletta, Emmanuel Hebrard et al.
Detecting and Exploiting Subproblem Tractability
Christian Bessiere, Clement Carbonnel, Emmanuel Hebrard et al.
Breakout Local Search for the Vertex Separator Problem
Una Benlic, Jin-Kao Hao
Maintaining Alternative Values in Constraint-Based Configuration
Caroline Becker, Hélène Fargier