Sciweavers

1264 search results - page 95 / 253
» The framework approach for constraint satisfaction
Sort
View
CP
2006
Springer
15 years 10 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa
IJCAI
2001
15 years 7 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
ANOR
2004
116views more  ANOR 2004»
15 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
CPAIOR
2010
Springer
15 years 4 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
SIGSOFT
2007
ACM
16 years 7 months ago
State space exploration using feedback constraint generation and Monte-Carlo sampling
The systematic exploration of the space of all the behaviours of a software system forms the basis of numerous approaches to verification. However, existing approaches face many c...
Sriram Sankaranarayanan, Richard M. Chang, Guofei ...