In this paper we describe how several search pruning concepts, commonly used in algorithms for solving covering problems, can be incorporated in algorithms for propositional satisfiability (SAT). In particular, we show that the concepts of row dominance and matrix partitioning, commonly used for solving unate and binate covering problems, can be naturally applied to SAT algorithms. Experimental...

Two strategies of randomized search, namely adaptive cluster covering (ACCO), and adaptive cluster covering with descent (ACD), are introduced and positioned in the group of the global optimization techniques. Several algorithms based on these new strategies are compared with other techniques of global randomized search in terms of effectiveness, efficiency and reliability. The other techniques...

The α-modulation spaces M p,q , introduced by Gröbner in [10] are a class of function spaces that contain Besov spaces B p,q (α = 1) and modulation spaces M s p,q (α = 0) as special cases. There are two kinds of basic coverings on Euclidean R which is very useful in the theory of function spaces and their applications, one is the uniform covering R = ⋃ k∈Zn Qk, where Qk denote the unit cube wit...