Sciweavers

2974 search results - page 121 / 595
» Model-Driven Constraint Programming
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 6 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
IJCAI
2003
15 years 7 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
VSTTE
2005
Springer
15 years 11 months ago
From the How to the What
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
Tiziana Margaria, Bernhard Steffen
SAC
2009
ACM
16 years 1 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck
SAS
2007
Springer
16 years 13 days ago
Refactoring Using Type Constraints
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
Frank Tip