73 search results - page 4 / 15 » Optimal Soft Arc Consistency |
ARCS
2010
Springer
15 years 8 months ago
2010
Springer
Register renaming is a widely used technique to remove false data dependencies in superscalar datapaths. Rename logic consists of a table that holds a physical register mapping for...
IJCAI
2003
15 years 3 months ago
2003
Many optimization problems can be expressed us ing some form of soft constraints, where different measures of desirability arc associated with differ ent combinations of domai...
115
click to vote
MICS
2007
15 years 1 months ago
2007
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
137
Voted
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
151
Voted
HEURISTICS
2006
15 years 1 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...