330 search results - page 24 / 66 » Diagnosing and Solving Over-Determined Constraint Satisfacti... |
ACST
2006
13 years 9 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
CP
2008
Springer
13 years 9 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...
ICTAI
2006
IEEE
14 years 2 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
FLAIRS
2003
13 years 9 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 ...