682 search results - page 76 / 137 » One-Counter Markov Decision Processes |
146
Voted
AI
2011
Springer
14 years 4 months ago
2011
Springer
In this work, we explore how local interactions can simplify the process of decision-making in multiagent systems, particularly in multirobot problems. We review a recent decision-...
118
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...
89
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
97
Voted
GLOBECOM
2006
IEEE
15 years 6 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...
152
click to vote
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...