90 search results - page 16 / 18 » On the hardness of finding symmetries in Markov decision pro... |
114
Voted
MOBIHOC
2008
ACM
16 years 20 days 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...
104
Voted
AAAI
2006
15 years 2 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
122
Voted
GLOBECOM
2010
IEEE
14 years 11 months ago
2010
IEEE
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...
112
Voted
NIPS
1998
15 years 2 months ago
1998
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
107
Voted
ICSM
2009
IEEE
15 years 7 months ago
2009
IEEE
Software entropy is a phenomenon where repeated changes gradually degrade the structure of the system, making it hard to understand and maintain. This phenomenon imposes challenge...