Cited in
(only showing first 100 items - show all)- Item response theory in AI: analysing machine learning classifiers at the instance level
- Captain Jack: new variable selection heuristics in local search for SAT
- Impact of Community Structure on SAT Solver Performance
- Pitfalls and best practices in algorithm configuration
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- On the design of metaheuristics-based algorithm portfolios
- meSAT: multiple encodings of CSP to SAT
- Algorithm portfolio selection as a bandit problem with unbounded losses
- Boosting local search thanks to \textsc{cdcl}
- Machine learning for first-order theorem proving
- A taxonomy of exact methods for partial Max-SAT
- Iterative-deepening search with on-line tree size prediction
- SATenstein: automatically building local search SAT solvers from components
- MaxSAT by improved instance-specific algorithm configuration
- Algorithm portfolios for noisy optimization
- Portfolio approaches for constraint optimization problems
- ProCount: weighted projected model counting with graded project-join trees
- Algorithm selection for dynamic symbolic execution: a preliminary study
- EUCLID
- Algorithm runtime prediction: methods \& evaluation
- Guiding high-performance SAT solvers with unsat-core predictions
- ASlib: a benchmark library for algorithm selection
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- A PAC Approach to Application-Specific Algorithm Selection
- Towards objective measures of algorithm performance across instance space
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Solving SAT in a distributed cloud: a portfolio approach
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- The complexity of probabilistic lobbying
- Portfolio theorem proving and prover runtime prediction for geometry
- Automated theorem proving in GeoGebra: current achievements
- MaLeS: a framework for automatic tuning of automated theorem provers
- Extreme cases in SAT problems
- The algorithm selection competitions 2015 and 2017
- Star-topology decoupled state space search
- scientific article; zbMATH DE number 7453125 (Why is no real title available?)
- scientific article; zbMATH DE number 7455711 (Why is no real title available?)
- Paracoherent answer set computation
- Propositional SAT solving
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Variable ordering for decision diagrams: a portfolio approach
- Algorithm survival analysis
- Benchmarking a model checker for algorithmic improvements and tuning for performance
- Autonomous operator management for evolutionary algorithms
- Optimal defense against election control by deleting voter groups
- A review of literature on parallel constraint solving
- SATzilla: portfolio-based algorithm selection for SAT
- A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
- Metaheuristics ``In the large
- Beaver
- Hyperheuristics
- ManySAT
- March_eq
- MiniSat
- Paramils
- PYTHIA
- UnitWalk
- Zchaff2004
- PLATYPUS
- MyPYTHIA
- SatEx
- GridSAT
- SATLIB
- UBCSAT
- FRODO__2
- QingTing1
- Lparse
- SAT competition
- Choco
- MiniZinc
- CDAOstore
- SPOT
- NeVer
- WEKA
- BerkMin
- PaMiraXT
- Potassco
- clasp
- gcl
- NumberJack
- Glucose
- irace
- Runsolver
- Cunf
- Jerusat
- QBFLIB
- MiniMaxSat
- BitBlaze
- Azucar
- URBiVA
- CSP2SAT4J
- CryptoMiniSat
- GlueMiniSat
- Proteus
- SOCRATES
- Sugar
- ppfolio
- claspfolio 2
This page was built for software: SATzilla
