Research map / Learning theory and algorithms / Combinatorial and search optimization
Reactive Dialectic Search Portfolios for MaxSAT
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 |
|---|---|---|---|
| make dialectic search parameters reactive (HRDS vs static CDS) (ablation) | ISAC++ dialectic search portfolio · MSE16 PMS Random | best upper bounds found: 24 -> 37 | Helped |
| make dialectic search parameters reactive (HRDS vs static CDS) (ablation) | ISAC++ dialectic search portfolio · MSE16 MS Random | best upper bounds found: 76 -> 82 | Helped |
| make dialectic search parameters reactive (HRDS vs static CDS) (ablation) | ISAC++ dialectic search portfolio · MSE16 MS Crafted | average time to best bound (s): 6.44 -> 0.80 | Helped |
| make dialectic search parameters reactive (HRDS vs static CDS) (ablation) | ISAC++ dialectic search portfolio · MSE16 WPMS Crafted | average time to best bound (s): 17.40 -> 41.68 | Hurt |
| add HRDS parameterizations to WPM3 portfolio | WPM3 · MSE16 PMS Crafted | best upper bounds found: 106 -> 116 | Helped |
| add HRDS parameterizations to WPM3 portfolio | WPM3 · MSE16 MS Random | best upper bounds found: 0 -> 83 | Helped |
| add HRDS parameterizations to WPM3 portfolio | WPM3 · MSE16 WPMS Random | best upper bounds found: 1 -> 99 | Helped |
| use HRDS/WPM3 instead of CDS/WPM3 (ablation) | WPM3 portfolio · MSE16 PMS Random | best upper bounds found: 25 -> 34 | Helped |
Closest papers by meaning
- Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis (AAAI 2025 · similarity 0.88)
- Enhance Diversified Top-k MaxSAT Solving by Incorporating New Strategy for Generating Diversified Initial Assignments (Student Abstract) (AAAI 2024 · similarity 0.86)
- Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving (AAAI 2024 · similarity 0.84)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.84)
- HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs (AAAI 2025 · similarity 0.83)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.82)
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.