UnitWalk - MaRDI portal

Cited in

(48)

From Idempotent Generalized Boolean Assignments to Multi-bit Search
scientific article; zbMATH DE number 5510692 (Why is no real title available?)
GridSAT: Design and implementation of a computational grid application
Boosting local search thanks to \textsc{cdcl}
A taxonomy of exact methods for partial Max-SAT
The state of SAT
A comparative runtime analysis of heuristic algorithms for satisfiability problems
A parallelization scheme based on work stealing for a class of SAT solvers
scientific article; zbMATH DE number 1961995 (Why is no real title available?)
Theory and Applications of Satisfiability Testing
Bounds-Consistent Local Search
Theory and Applications of Satisfiability Testing
A Decision-Making Procedure for Resolution-Based SAT-Solvers
Theory and Applications of Satisfiability Testing
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
On SAT instance classes and a method for reliable performance experiments with SAT solvers
Machine learning-based restart policy for CDCL SAT solvers
Artificial Evolution
GridLab
SatEx
GridSAT
SATLIB
UBCSAT
QingTing1
SATO
Walksat
PBS
GrADS
BerkMin
GrADSAT
Jerusat
QBFLIB
NAGSAT
ZetaSAT
Velev SAT Benchmarks
A SAT approach to query optimization in mediator systems
The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
Algorithmic Applications in Management
A switching criterion for intensification and diversification in local search for SAT
An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
Justification-Based Local Search with Adaptive Noise Strategies
Phase transitions in machine learning.
Theory and Applications of Satisfiability Testing
Determinization of Resolution by an Algorithm Operating on Complete Assignments
Improved local search for circuit satisfiability
scientific article; zbMATH DE number 1927173 (Why is no real title available?)
Decision procedures. An algorithmic point of view
Locality and hard SAT-instances

This page was built for software: UnitWalk