61 search results - page 8 / 13 » A Clause-Based Heuristic for SAT Solvers |
112
click to vote
DATE
2004
IEEE
15 years 3 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...
92
Voted
CP
2007
Springer
15 years 3 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
178
click to vote
CP
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
99
Voted
ECOOP
2011
Springer
13 years 11 months ago
2011
Springer
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
SAT
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...