334 search results - page 28 / 67 » How to Dynamically Merge Markov Decision Processes |
109
click to vote
RSS
2007
14 years 11 months ago
2007
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
IJCAI
2003
14 years 11 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
AOR
2010
14 years 7 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
105
click to vote
ECML
2007
Springer
14 years 11 months ago
2007
Springer
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...