882 search results - page 19 / 177 » Local Search for Very Large SAT Problems |
ATS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...
SC
2005
ACM
14 years 29 days ago
2005
ACM
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
ICCD
2001
IEEE
14 years 4 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...