Solving SAT in a distributed cloud: a portfolio approach
From MaRDI portal
Publication:2299084
Recommendations
Cites work
- An overview of parallel SAT solving
- scientific article; zbMATH DE number 1323125 (Why is no real title available?)
- PSATO: A distributed propositional prover and its application to quasigroup problems
- SATzilla: portfolio-based algorithm selection for SAT
- The state of SAT
- Theory and Applications of Satisfiability Testing
Cited in
(6)- Scalable SAT solving in the cloud
- Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
- Approximating the discrete resource sharing scheduling problem
- Partitioning SAT instances for distributed solving
- Active learning for SAT solver benchmarking. Extended and revised version
- Selection hyper-heuristics and job shop scheduling problems: how does instance size influence performance?
Describes a project that uses
Uses Software
This page was built for publication: Solving SAT in a distributed cloud: a portfolio approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299084)