4426 search results - page 728 / 886 » Concurrent Constraint Programming |
118
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
133
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
138
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this article we will present some problems that have weak symmetries. In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and pres...
128
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
135
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...