Partitioning Search Spaces of a Randomized Search
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 243-252
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Strategies for Solving SAT in Grids by Randomized Search2008
- A Distribution Method for Solving SAT in Grids2006
- A Parallelization Scheme Based on Work Stealing for a Class of SAT SolversJournal of Automated Reasoning, 2005
- An Extensible SAT-solver2004
- Algorithm portfoliosArtificial Intelligence, 2001
- Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction ProblemsJournal of Automated Reasoning, 2000
- An Economics Approach to Hard Computational ProblemsScience, 1997
- A fast parallel SAT-solver — efficient workload balancingAnnals of Mathematics and Artificial Intelligence, 1996
- PSATO: a Distributed Propositional Prover and its Application to Quasigroup ProblemsJournal of Symbolic Computation, 1996
- Optimal speedup of Las Vegas algorithmsInformation Processing Letters, 1993