Sciweavers

80 search results - page 11 / 16
» Symmetry Breaking Constraints for Value Symmetries in Constr...
Sort
View
CP
2006
Springer
13 years 11 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
AISC
2008
Springer
13 years 9 months ago
The Monoids of Order Eight and Nine
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
Andreas Distler, Tom Kelsey
DAC
2008
ACM
14 years 8 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
CPAIOR
2010
Springer
14 years 11 days 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...
CP
2004
Springer
14 years 29 days ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet