Sciweavers

104 search results - page 7 / 21
» A Domain Consistency Algorithm for the Stretch Constraint
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
HEURISTICS
2006
148views more  HEURISTICS 2006»
13 years 7 months ago
On global warming: Flow-based soft global constraints
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...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
CORR
2004
Springer
136views Education» more  CORR 2004»
13 years 7 months ago
On Global Warming (Softening Global Constraints)
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
AAAI
1996
13 years 8 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
CP
2008
Springer
13 years 9 months ago
Connecting ABT with Arc Consistency
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
Ismel Brito, Pedro Meseguer