Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
This paper examines the identification of multi-input systems. Motivated by an experiment design problem (should one excite the various inputs simultaneously or separately), we ex...
Michel Gevers, Ljubisa Miskovic, Dominique Bonvin,...
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...