Sciweavers

226 search results - page 25 / 46
» A Monte-Carlo AIXI Approximation
Sort
View
105
Voted
ENC
2005
IEEE
15 years 6 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
HYBRID
2005
Springer
15 years 6 months ago
Polynomial Stochastic Hybrid Systems
This paper deals with polynomial stochastic hybrid systems (pSHSs), which generally correspond to stochastic hybrid systems with polynomial continuous vector fields, reset maps, a...
João P. Hespanha
107
Voted
AAAI
2012
13 years 2 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
119
Voted
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 3 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
JMLR
2006
143views more  JMLR 2006»
15 years 11 days ago
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
Rémi Munos