27 search results - page 5 / 6 » Cost-Based Arc Consistency for Global Cardinality Constraint... |
CP
2011
Springer
12 years 8 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
CSFW
2004
IEEE
14 years 8 days ago
2004
IEEE
Workflow management systems (WFMSs) have attracted a lot of interest both in academia and the business community. A workflow consists of a collection of tasks that are organized t...
CPAIOR
2006
Springer
14 years 8 days ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
EMMCVPR
2011
Springer
12 years 8 months ago
2011
Springer
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
COMPULOG
1999
Springer
14 years 25 days ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...