17 search results - page 2 / 4 » Symmetry Breaking for Maximum Satisfiability |
DATE
2004
IEEE
13 years 8 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...
JUCS
2007
13 years 4 months ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
EMNLP
2011
12 years 4 months ago
2011
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...