Sciweavers

771 search results - page 134 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
IPPS
2002
IEEE
15 years 4 months ago
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
Gang George Yin, Cheng-Zhong Xu, Le Yi Wang
ICML
1996
IEEE
15 years 3 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
EENERGY
2010
15 years 3 months ago
Optimal sleep patterns for serving delay-tolerant jobs
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
WCNC
2010
IEEE
15 years 3 months ago
Dynamic Control of Data Ferries under Partial Observations
—Controlled mobile helper nodes called data ferries have recently been proposed to bridge communications between disconnected nodes in a delay-tolerant manner. While existing wor...
Chi Harold Liu, Ting He, Kang-won Lee, Kin K. Leun...
AI
2006
Springer
15 years 3 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar