157 search results - page 11 / 32 » Multi-Objective Propagation in Constraint Programming |
CCL
1994
Springer
13 years 11 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
CP
2009
Springer
14 years 8 months ago
2009
Springer
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
CP
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CP
2003
Springer
14 years 19 days 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...