12 search results - page 2 / 3 » An Efficient Way of Breaking Value Symmetries |
103
Voted
CSCLP
2006
Springer
15 years 3 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
95
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
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 ...
103
Voted
CP
2008
Springer
15 years 1 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
94
Voted
CP
2006
Springer
15 years 3 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Many symmetry breaking methods have been proposed so far. Previous works have shown that these methods could be combined together under some conditions. We use a different angle :...