1176 search results - page 27 / 236 » Sparse reward processes |
141
Voted
AI
2008
Springer
15 years 3 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
179
Voted
NFM
2011
14 years 10 months ago
2011
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
117
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
117
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Multimedia social network is a network infrastructure in which the social network members share multimedia contents with all different purposes. Analyzing user behavior in multime...
126
Voted
FCCM
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an architecture and an implementation of an FPGA-based sparse matrix-vector multiplier (SMVM) for use in the iterative solution of large, sparse systems of equations ar...