656 search results - page 83 / 132 » Complexity of finite-horizon Markov decision process problem... |
112
click to vote
MOR
2008
15 years 1 months ago
2008
We consider the average cost problem for partially observable Markov decision processes (POMDP) with finite state, observation, and control spaces. We prove that there exists an -...
141
click to vote
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
ICIP
2003
IEEE
16 years 3 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
109
click to vote
AAAI
1990
15 years 3 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
127
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...