Sciweavers

403 search results - page 21 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
UAI
2003
13 years 11 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 1 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noisy BBOB-2010 testbed
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
JAIR
2008
113views more  JAIR 2008»
13 years 9 months ago
Graphical Model Inference in Optimal Control of Stochastic Multi-Agent Systems
In this article we consider the issue of optimal control in collaborative multi-agent systems with stochastic dynamics. The agents have a joint task in which they have to reach a ...
Bart van den Broek, Wim Wiegerinck, Bert Kappen
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 9 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
PODS
2009
ACM
112views Database» more  PODS 2009»
14 years 10 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...