# Partitioning Search Spaces of a Randomized Search

^{1}

## Summary (1 min read)

### B Experimental Results 21

- In this work1 the authors develop distributed techniques for solving challenging instances of the propositional satisfiability problem (SAT).
- Section 3 studies analytically the expected run time of a plain partitioning approach where a SAT instance is partitioned and then a randomized SAT solver is used to solve the resulting instances.
- Again, the authors denote the random variable describing the run time of the resulting plain partitioning approach by T npart.
- The authors denote the random variable describing the run time of this approach by T nrep-part.

Did you find this useful? Give us your feedback

##### Citations

39 citations

^{1}

32 citations

30 citations

### Cites background from "Partitioning Search Spaces of a Ran..."

...This indicates the difficulty of making fair splits in view of irregular search spaces, while running different configurations in parallel improves the chance of success (cf. (Hyvärinen et al. 2011))....

[...]

28 citations

### Cites background from "Partitioning Search Spaces of a Ran..."

...Often these approaches are combined in various ways; see [63,22,38,39] for recent examples....

[...]

21 citations

### Cites background from "Partitioning Search Spaces of a Ran..."

...1This is an extended version of the paper to appear in the 11th Conference of the Italian Association for Artificial Intelligence (AI*IA 2009) [6] with two new appendices containing proofs for the propositions and additional experimental results....

[...]

##### References

2,985 citations

460 citations

[...]

457 citations

433 citations

^{1}

407 citations