Sciweavers

314 search results - page 22 / 63
» A non-binary constraint ordering heuristic for constraint sa...
Sort
View
21
Voted
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 6 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
CPAIOR
2007
Springer
14 years 1 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
CP
2008
Springer
13 years 9 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
SAC
2009
ACM
14 years 2 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi