73 search results - page 7 / 15 » The SAT 2005 Solver Competition on Random Instances |
CP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
AAAI
2010
13 years 5 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
ICCD
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
JSAT
2008
13 years 7 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...