749 search results - page 131 / 150 » Dualities for Constraint Satisfaction Problems |
EVOW
2010
Springer
14 years 2 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
CP
2007
Springer
14 years 4 months ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
KBSE
1997
IEEE
14 years 2 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...