Sciweavers

41 search results - page 3 / 9
» Automatically Exploiting Symmetries in Constraint Programmin...
Sort
View
82
Voted
CSCLP
2004
Springer
15 years 1 months ago
Constraint-Based Approaches to the Covering Test Problem
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
81
Voted
CP
2005
Springer
15 years 3 months ago
Breaking All Value Symmetries in Surjection Problems
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Jean-Francois Puget
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 1 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
70
Voted
CP
2004
Springer
15 years 1 months ago
Full Dynamic Substitutability by SAT Encoding
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
Steven David Prestwich
77
Voted
POPL
2010
ACM
15 years 2 months ago
Parallelizing constraint programs
The availability of commodity multi-core and multi-processor machinesandtheinherentparallelisminconstraintprogrammingsearchoffer significant opportunities for constraint programmi...
Laurent D. Michel