Sciweavers

129 search results - page 12 / 26
» Abstractive Meeting Summarization as a Markov Decision Proce...
Sort
View
GECCO
2004
Springer
142views Optimization» more  GECCO 2004»
15 years 3 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...
ECSQARU
2001
Springer
15 years 2 months ago
Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Nevin Lianwen Zhang, Weihong Zhang
ICMLA
2009
14 years 7 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
ECAI
2008
Springer
14 years 11 months ago
A hybrid approach to multi-agent decision-making
Abstract. In the aftermath of a large-scale disaster, agents’ decisions derive from self-interested (e.g. survival), common-good (e.g. victims’ rescue) and teamwork (e.g. fire...
Paulo Trigo, Helder Coelho
QEST
2010
IEEE
14 years 7 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...