320 search results - page 6 / 64 » Evaluation of Solving Models for Conditional Constraint Sati... |
AICOM
2004
13 years 8 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
AIMSA
2008
Springer
13 years 10 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....
CONSTRAINTS
2010
13 years 8 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
ECML
2005
Springer
14 years 2 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
SPDP
1991
IEEE
14 years 6 days ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...