1453 search results - page 186 / 291 » Partial Constraint Satisfaction |
139
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
164
click to vote
PKDD
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. A new constrained model is discussed as a way of incorporating efficiently a priori expert knowledge into a clustering problem of a given individual set. The first innova...
132
click to vote
ICLP
2004
Springer
15 years 10 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
161
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
141
click to vote
ISBI
2006
IEEE
16 years 5 months ago
2006
IEEE
We present an algebraic solution to direct registration of diffusion tensor images under various local deformation models. We show how to linearly recover the deformation from the...