269 search results - page 1 / 54 » Semidefinite Optimization Approaches for Satisfiability and ... |
JSAT
2006
13 years 4 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
AIPS
2006
13 years 6 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
IPL
2008
13 years 4 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
DATE
2008
IEEE
13 years 6 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
FMCAD
2007
Springer
13 years 8 months ago
2007
Springer
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sourc...