150 search results - page 7 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
AMAI
1999
Springer
14 years 9 months 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...
FLAIRS
2003
14 years 11 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
153
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
96
Voted
CP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
MICAI
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...