10 search results - page 2 / 2 » Generalizing Core-Guided Max-SAT |
111
Voted
GECCO
2008
Springer
15 years 3 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 ...
127
click to vote
AIPS
2006
15 years 4 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...
130
Voted
ECOOP
2011
Springer
14 years 2 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...
150
Voted
WEBDB
2010
Springer
15 years 7 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...
152
Voted
ICCAD
2002
IEEE
15 years 11 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...