771 search results - page 46 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
NIPS
2003
15 years 3 months ago
2003
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...
127
click to vote
UML
2001
Springer
15 years 6 months ago
2001
Springer
Modern distributed software applications generally operate in complex and heterogeneous computing environments (like the World Wide Web). Different paradigms (client-server, mobili...
114
Voted
AIPS
2000
15 years 3 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
98
Voted
ORL
2006
15 years 1 months ago
2006
We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We int...
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...