882 search results - page 27 / 177 » Local Search for Very Large SAT Problems |
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
CONSTRAINTS
2007
14 years 11 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
100
click to vote
AAAI
2004
15 years 1 months ago
2004
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
104
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
DAC
2002
ACM
16 years 21 days ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...