673 search results - page 63 / 135 » Preference-Based Problem Solving for Constraint Programming |
119
Voted
CP
2007
Springer
15 years 10 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
135
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
134
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
123
click to vote
CC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
138
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...