Sciweavers

829 search results - page 59 / 166
» A time aggregation approach to Markov decision processes
Sort
View
PRICAI
2000
Springer
15 years 9 months ago
Generating Hierarchical Structure in Reinforcement Learning from State Variables
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
Bernhard Hengst
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 6 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
SDM
2007
SIAM
131views Data Mining» more  SDM 2007»
15 years 7 months ago
Load Shedding in Classifying Multi-Source Streaming Data: A Bayes Risk Approach
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...
Yijian Bai, Haixun Wang, Carlo Zaniolo
ASC
2004
15 years 6 months ago
Evaluation of services using a fuzzy analytic hierarchy process
This paper proposes a new approach for tackling the uncertainty and imprecision of the service evaluation process. Identifying suitable service offers, evaluating the offers and c...
Ludmil Mikhailov, Petco E. Tsvetinov
ATAL
2007
Springer
16 years 10 days ago
A globally optimal algorithm for TTD-MDPs
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Cha...