882 search results - page 12 / 177 » Local Search for Very Large SAT Problems |
DDECS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Recently, there is a renewed interest in Automatic Test Pattern Generation (ATPG) based on Boolean Satisfiability (SAT). This results from the availability of very powerful SA...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....