atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Component Caching in Hybrid Domains with Piecewise Polynomial Densities

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 20 citations (OpenAlex)

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 changedWhereMeasuredEffect
use component caching with eager encoding instead of block-clause enumerationWMI solver · alarm hybrid, 15 missing evidenceexecution time (s): BC did not terminate vs CC 0.00Helped
use component caching instead of AllSAT enumerationWMI solver · alarm hybrid, 20 missing evidenceexecution time (s): 2842.69 -> 0.01Helped
use component caching instead of AllSAT enumerationWMI solver · water hybrid, 15 missing evidenceexecution time (s): 2282.18 -> 0.01Helped
use polynomial densities instead of piecewise constant (ablation)CC · alarm hybrid, no evidenceexecution time (s): 3.06 -> 26.94Hurt
use polynomial densities instead of piecewise constant (ablation)CC · insurance hybrid, no evidenceexecution time (s): 20.77 -> 135.49Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy