288 search results - page 23 / 58 » Risk-averse dynamic programming for Markov decision processe... |
121
click to vote
AAAI
2012
13 years 3 months ago
2012
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...
GLOBECOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We consider the problem of providing absolute QoS guarantees to multiple classes of users of an OBS network in terms of the end-to-end burst loss. We employ Markov decision pro...
106
click to vote
NIPS
2001
15 years 2 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
122
click to vote
ALDT
2009
Springer
15 years 8 months ago
2009
Springer
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 ...
112
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...