601 search results - page 31 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
105
Voted
CONSTRAINTS
2010
15 years 1 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
110
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
111
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
106
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
115
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...