771 search results - page 129 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
123
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
104
Voted
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
110
Voted
ICML
2002
IEEE
16 years 2 months ago
2002
IEEE
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
123
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
114
click to vote
HYBRID
2010
Springer
15 years 8 months ago
2010
Springer
We consider an anytime control algorithm for the situation when the processor resource availability is time-varying. The basic idea is to calculate the components of the control i...