Sciweavers

714 search results - page 2 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CPAIOR
2009
Springer
13 years 12 months ago
Six Ways of Integrating Symmetries within Non-overlapping Constraints
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
Magnus Ågren, Nicolas Beldiceanu, Mats Carls...
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 5 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
PROCEDIA
2011
12 years 8 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
CONSTRAINTS
2007
120views more  CONSTRAINTS 2007»
13 years 5 months ago
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems
Yat Chiu Law, Jimmy Ho-Man Lee, Barbara M. Smith
AAAI
2012
11 years 7 months ago
A Dichotomy for 2-Constraint Forbidden CSP Patterns
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
Martin C. Cooper, Guillaume Escamocher