257 search results - page 8 / 52 » Breaking Value Symmetry |
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
ECAI
2004
Springer
14 years 29 days ago
2004
Springer
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 ...
IJCAI
2003
13 years 9 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...