76 search results - page 3 / 16 » Extending to Soft and Preference Constraints a Framework for... |
HEURISTICS
2006
13 years 5 months ago
2006
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
AAAI
2006
13 years 7 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
ICCBR
2003
Springer
13 years 11 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...
MOZ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
AAAI
1998
13 years 7 months ago
1998
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...