Sciweavers

288 search results - page 41 / 58
» Risk-averse dynamic programming for Markov decision processe...
Sort
View
NIPS
2003
15 years 2 months ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh
IJCAI
2007
15 years 2 months ago
Bayesian Inverse Reinforcement Learning
Inverse Reinforcement Learning (IRL) is the problem of learning the reward function underlying a Markov Decision Process given the dynamics of the system and the behaviour of an e...
Deepak Ramachandran, Eyal Amir
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
14 years 11 months ago
Uncertainty handling CMA-ES for reinforcement learning
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
Verena Heidrich-Meisner, Christian Igel
JSAC
2010
107views more  JSAC 2010»
14 years 11 months ago
Online learning in autonomic multi-hop wireless networks for transmitting mission-critical applications
Abstract—In this paper, we study how to optimize the transmission decisions of nodes aimed at supporting mission-critical applications, such as surveillance, security monitoring,...
Hsien-Po Shiang, Mihaela van der Schaar
IEEEPACT
2000
IEEE
15 years 5 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte