470 search results - page 2 / 94 » Tabu Search for SAT |
AI
2003
Springer
13 years 10 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
EVOW
2008
Springer
13 years 7 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...
EOR
2000
13 years 5 months ago
2000
A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
SAT
2010
Springer
13 years 3 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...