2109 search results - page 49 / 422 » Solving Necklace Constraint Problems |
139
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
117
click to vote
IPL
2007
15 years 4 months ago
2007
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
153
click to vote
IJCAI
1989
15 years 5 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
112
click to vote
IJCAI
1997
15 years 5 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
129
click to vote
ICTAI
2008
IEEE
15 years 11 months ago
2008
IEEE
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...