Sciweavers

960 search results - page 11 / 192
» Optimal Monte Carlo Algorithms
Sort
View
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 3 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi
TWC
2010
14 years 4 months ago
A fixed-lag particle smoother for blind SISO equalization of time-varying channels
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
Alberto Gaspar Guimarães, Boujemaa Ait-El-F...
CG
2010
Springer
14 years 7 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
UAI
2003
14 years 10 months ago
Monte-Carlo optimizations for resource allocation problems in stochastic network systems
Real-world distributed systems and networks are often unreliable and subject to random failures of its components. Such a stochastic behavior affects adversely the complexity of o...
Milos Hauskrecht, Tomás Singliar
WSC
1998
14 years 10 months ago
Average Performance of Quasi Monte Carlo Methods for Global Optimization
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability ...
Hisham A. Al-Mharmah