380 search results - page 18 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
KCAP
2005
ACM
14 years 1 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
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 ...
AIMSA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....