Sciweavers

829 search results - page 93 / 166
» A time aggregation approach to Markov decision processes
Sort
View
ICDCS
2006
IEEE
16 years 27 days ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
ICML
1998
IEEE
16 years 7 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
AAAI
2007
15 years 9 months ago
Optimizing Anthrax Outbreak Detection Using Reinforcement Learning
The potentially catastrophic impact of a bioterrorist attack makes developing effective detection methods essential for public health. In the case of anthrax attack, a delay of ho...
Masoumeh T. Izadi, David L. Buckeridge
NIPS
2003
15 years 8 months ago
Approximate Policy Iteration with a Policy Language Bias
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
Alan Fern, Sung Wook Yoon, Robert Givan
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
16 years 1 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith