10 search results - page 2 / 2 » Generalizing Core-Guided Max-SAT |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
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...
ECOOP
2011
Springer
12 years 5 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...
WEBDB
2010
Springer
13 years 10 months ago
2010
Springer
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
ICCAD
2002
IEEE
14 years 2 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...