Sciweavers

595 search results - page 19 / 119
» A Constraint Programming Approach for Solving a Queueing Con...
Sort
View
CPAIOR
2010
Springer
13 years 6 months 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
CSUR
2000
69views more  CSUR 2000»
13 years 8 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet
ISPD
1999
ACM
94views Hardware» more  ISPD 1999»
14 years 1 months ago
Gate sizing with controlled displacement
- In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing c...
Wei Chen, Cheng-Ta Hsieh, Massoud Pedram
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
14 years 3 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...
ISSRE
2007
IEEE
13 years 10 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...