1 citations · 1 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Stochastic Enumeration with Importance Sampling
Alathea Jensen
Many hard problems in the computational sciences are equivalent to counting the leaves of a decision tree, or, more generally, summing a cost function over the nodes. These problem…
cs.DS2019★ 1 cited
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions
Isabel Beichl, Alathea Jensen
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume…