942 search results - page 79 / 189 » Distance Constraint Satisfaction Problems |
116
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
141
click to vote
SAC
2003
ACM
15 years 8 months ago
2003
ACM
DICE (DIstributed Constraint Environment) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. The...
115
Voted
TACAS
2010
Springer
15 years 8 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
114
click to vote
MST
2008
15 years 3 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
119
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...