The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
In this paper, we propose a range-free cooperative localization algorithm for mobile sensor networks by combining hop distance measurements and particle filtering. In the hop dist...
Hongyang Chen, Marcelo H. T. Martins, Pei Huang, H...
Policy search is a successful approach to reinforcement learning. However, policy improvements often result in the loss of information. Hence, it has been marred by premature conv...
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...