79 search results - page 15 / 16 » Arc-Consistency and Arc-Consistency Again |
AAAI
1994
13 years 8 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
AI
2006
Springer
13 years 7 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
AI
2005
Springer
13 years 7 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
JETAI
2010
13 years 6 months ago
2010
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...