Sciweavers

829 search results - page 50 / 166
» A time aggregation approach to Markov decision processes
Sort
View
GECCO
2004
Springer
142views Optimization» more  GECCO 2004»
15 years 11 months ago
Improving MACS Thanks to a Comparison with 2TBNs
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...
Olivier Sigaud, Thierry Gourdin, Pierre-Henri Wuil...
ICMLA
2009
15 years 3 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson
ICCAD
2002
IEEE
122views Hardware» more  ICCAD 2002»
16 years 3 months ago
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
Sorin Manolache, Petru Eles, Zebo Peng
IPPS
2007
IEEE
16 years 13 days ago
Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid
In this paper we propose a new query processing method for the OLAP Enabled Grid, which blends sophisticated cache extraction techniques and data grid scheduling to efficiently s...
Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau...
NIPS
2004
15 years 7 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky