Sciweavers

2864 search results - page 224 / 573
» Constraint Programming in OPL
Sort
View
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 3 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
AAAI
2004
14 years 5 days ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
CSR
2009
Springer
13 years 12 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
CP
2010
Springer
13 years 9 months ago
Exponential Propagation for Set Variables
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
Justin Yip, Pascal Van Hentenryck
CONSTRAINTS
2011
13 years 5 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...