Sciweavers

7092 search results - page 255 / 1419
» Parallelizing constraint programs
Sort
View
POPL
2010
ACM
15 years 10 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
182
Voted
CP
2009
Springer
16 years 1 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
97
Voted
CP
2005
Springer
15 years 6 months ago
Graph Invariants as Necessary Conditions for Global Constraints
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...
CP
2005
Springer
15 years 6 months ago
Acquiring Parameters of Implied Global Constraints
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
Christian Bessière, Remi Coletta, Thierry P...
CP
2003
Springer
15 years 5 months ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann