Efficient Caching in Elimination Trees

Kevin Grant, Michael C. Horsch

In this paper, we present subcaching, a method for reducing the size of the caches in the recursive decomposition while maintaining the runtime of recursive conditioning with complete caching. We also demonstrate a heuristic for constructing recursive decompositions that improves the effects of subcaching, and show empirically that the savings in space is quite substantial, with very little effect on the runtime of recursive conditioning.

Subjects: 3.4 Probabilistic Reasoning

Submitted: Feb 10, 2007

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.