882 search results - page 28 / 177 » Local Search for Very Large SAT Problems |
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
—In this paper, the performance of dynamic multi-swarm particle swarm optimizer (DMS-PSO) on the set of benchmark functions provided for the CEC2008 Special Session on Large Scal...
JAIR
2008
14 years 11 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
102
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
137
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...