Sciweavers

AAAI
2012
12 years 1 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
CCE
2004
13 years 11 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
WSC
1997
14 years 26 days ago
Descriptive Sampling: An Improvement over Latin Hypercube Sampling
Descriptive Sampling (DS), a Monte Carlo sampling technique based on a deterministic selection of the input values and their random permutation, represents a deep conceptual chang...
Eduardo Saliby