Sciweavers

592 search results - page 24 / 119
» Using Constraint Programming to Solve the Maximum Clique Pro...
Sort
View
179
Voted
CPAIOR
2010
Springer
15 years 18 days ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
148
Voted
DAC
2006
ACM
16 years 3 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
139
Voted
CP
2003
Springer
15 years 7 months ago
Semi-automatic Modeling by Constraint Acquisition
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
Remi Coletta, Christian Bessière, Barry O'S...
143
Voted
AGP
1999
IEEE
15 years 7 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
139
Voted
COMPULOG
1999
Springer
15 years 6 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták