Sciweavers

189 search results - page 6 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
CP
2004
Springer
14 years 2 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit
CORR
2011
Springer
245views Education» more  CORR 2011»
13 years 3 months ago
A linear framework for region-based image segmentation and inpainting involving curvature penalization
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Da...
CPAIOR
2009
Springer
14 years 3 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
CSCLP
2005
Springer
14 years 2 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
CP
2000
Springer
14 years 29 days ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti