Sciweavers

CP
2010
Springer
13 years 10 months ago
Contingency Plans for Air Traffic Management
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
CP
2010
Springer
13 years 10 months ago
Ensemble Classification for Constraint Solver Configuration
The automatic tuning of the parameters of algorithms and automatic selection of algorithms has received a lot of attention recently. One possible approach is the use of machine lea...
Lars Kotthoff, Ian Miguel, Peter Nightingale
CP
2010
Springer
13 years 10 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
CP
2010
Springer
13 years 10 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
CP
2010
Springer
13 years 10 months ago
An Empirical Study of Optimization for Maximizing Diffusion in Networks
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
Kiyan Ahmadizadeh, Bistra N. Dilkina, Carla P. Gom...
CP
2010
Springer
13 years 10 months ago
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the...
Alexandre Goldsztejn, Olivier Mullier, Damien Evei...
CP
2010
Springer
13 years 11 months ago
Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
Russell Bent, Pascal Van Hentenryck
CP
2010
Springer
13 years 11 months ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan
CP
2010
Springer
13 years 11 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
CP
2010
Springer
13 years 11 months ago
Using Learnt Clauses in maxsat
Jessica Davies, Jeremy Cho, Fahiem Bacchus