942 search results - page 30 / 189 » Distance Constraint Satisfaction Problems |
122
Voted
CSR
2009
Springer
15 years 2 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
138
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
113
Voted
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
112
Voted
AMAI
1999
Springer
15 years 22 days ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
108
click to vote
DAGSTUHL
2008
15 years 2 months ago
2008
Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic...