CP
2003
Springer
14 years 5 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
CP
2003
Springer
14 years 5 months ago
2003
Springer
CP
2003
Springer
14 years 5 months ago
2003
Springer
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we w...
CP
2003
Springer
14 years 5 months ago
2003
Springer
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
CP
2003
Springer
14 years 5 months ago
2003
Springer
CP
2003
Springer
14 years 5 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
CP
2003
Springer
14 years 5 months ago
2003
Springer
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
CP
2003
Springer
14 years 5 months ago
2003
Springer
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
CP
2003
Springer
14 years 5 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
CP
2003
Springer
14 years 5 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...