285 search results - page 2 / 57 » The complexity of soft constraint satisfaction |
89
Voted
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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
74
Voted
CAEPIA
2003
Springer
15 years 2 months ago
2003
Springer
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
62
Voted
FLAIRS
2003
14 years 10 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...