Sciweavers

4854 search results - page 755 / 971
» It's the Programming, Stupid
Sort
View
CP
2007
Springer
16 years 22 days ago
Model-Driven Visualizations of Constraint-Based Local Search
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
Grégoire Dooms, Pascal Van Hentenryck, Laur...
CP
2007
Springer
16 years 22 days ago
Solution Directed Backjumping for QCSP
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
Fahiem Bacchus, Kostas Stergiou
CP
2007
Springer
16 years 22 days ago
Path Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Christophe Lecoutre, Stéphane Cardon, Julie...
CP
2007
Springer
16 years 22 days ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
CPAIOR
2007
Springer
16 years 22 days ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...