Sciweavers

21 search results - page 4 / 5
» Breaking Symmetry of Interchangeable Variables and Values
Sort
View
ECAI
2008
Springer
13 years 8 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
CPAIOR
2010
Springer
13 years 11 months ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
IJCAI
2003
13 years 8 months ago
Multiset Ordering Constraints
We identify a new and important global (or nonbinary) constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This const...
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahi...
ECAI
2004
Springer
14 years 3 days ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
AI
2006
Springer
13 years 6 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...