1381 search results - page 66 / 277 » Computational Complexity of Constraint Satisfaction |
141
click to vote
CP
1998
Springer
15 years 8 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
141
click to vote
KBSE
1997
IEEE
15 years 8 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...
130
click to vote
IJCAI
2007
15 years 5 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
129
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
124
click to vote
CHI
2007
ACM
16 years 4 months ago
2007
ACM
Understanding the relation between usability measures seems crucial to deepen our conception of usability and to select the right measures for usability studies. We present a meta...