882 search results - page 4 / 177 » Local Search for Very Large SAT Problems |
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
DISOPT
2011
13 years 2 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
EC
2008
13 years 7 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...