2864 search results - page 102 / 573 » Constraint Programming in OPL |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
ISSRE
2007
IEEE
13 years 10 months ago
2007
IEEE
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...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
BMCBI
2011
13 years 4 months ago
2011
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
PPDP
2001
Springer
14 years 1 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...