Sciweavers

2864 search results - page 84 / 573
» Constraint Programming in OPL
Sort
View
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 9 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
SQJ
2010
112views more  SQJ 2010»
13 years 3 months ago
Improving design-pattern identification: a new approach and an exploratory study
The identification of occurrences of design patterns in programs can help maintainers to understand the program design and implementation. It can also help them to make informed ch...
Yann-Gaël Guéhéneuc, Jean-Yves ...
CP
2004
Springer
14 years 2 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 9 months ago
An Analysis of Arithmetic Constraints on Integer Intervals
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
Krzysztof R. Apt, Peter Zoeteweij
AMC
2008
106views more  AMC 2008»
13 years 9 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido