2266 search results - page 28 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
AAAI
2004
15 years 1 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
114
click to vote
PPSN
1994
Springer
15 years 3 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
103
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
DFT
2005
IEEE
15 years 5 months ago
2005
IEEE
Fabricating large memory and processor arrays is subject to physical failures resulting in yield degradation. The strategy of incorporating spare rows and columns to obtain reason...
STOC
2009
ACM
16 years 11 days ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...