Sciweavers

209 search results - page 2 / 42
» Speeding Up Constraint Propagation
Sort
View
CP
2010
Springer
14 years 10 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
SAC
2009
ACM
15 years 6 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand
CPAIOR
2005
Springer
15 years 5 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
CPAIOR
2008
Springer
15 years 1 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
DATE
2009
IEEE
101views Hardware» more  DATE 2009»
15 years 6 months ago
Speeding up model checking by exploiting explicit and hidden verification constraints
Gianpiero Cabodi, Paolo Camurati, Luz Garcia, Marc...