Research map / Learning theory and algorithms / Combinatorial and search optimization
Exponential Recency Weighted Average Branching Heuristic for SAT Solvers
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace VSIDS with CHB branching heuristic | MiniSat · SAT Competition 2013+2014 app+crafted | solved instances: 604 -> 701 (+16.1%) | Helped |
| replace VSIDS with CHB branching heuristic | Glucose · SAT Competition 2013+2014 app+crafted | solved instances: 806 -> 851 (+5.6%) | Helped |
| replace VSIDS with CHB branching heuristic | MiniSat · SAT Competition 2014 application, UNSAT | solved instances: 56 -> 49 (-12.5%) | Hurt |
| replace VSIDS with CHB branching heuristic | Glucose · SAT Competition 2014 application | solved instances: 215 -> 209 (-2.8%) | Hurt |
| replace VSIDS with CHB branching heuristic | MiniSat · SAT Competition 2013 crafted, SAT | solved instances: 106 -> 106 (0.0%) | No clear effect |
| replace VSIDS with CHB branching heuristic | MiniSat · step-reduced SHA-1 and MD5 preimage (60 instances) | solved instances: +3 on 23-step SHA-1, +1 on 28-step MD5 | Helped |
| replace VSIDS with CHB branching heuristic | Glucose · step-reduced SHA-1 preimage | solved instances: +3 on 21-step, +2 on 22-step SHA-1 | Helped |
Closest papers by meaning
- Guiding CDCL SAT Search via Random Exploration amid Conflict Depression (AAAI 2020 · similarity 0.88)
- Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver? (NeurIPS 2020 · similarity 0.87)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.85)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.85)
- Learning How to Cube (NeurIPS 2026 · similarity 0.85)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.