63 search results - page 12 / 13 » Mean field for Markov Decision Processes: from Discrete to C... |
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision ...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
F0 is an acoustic feature that varies largely from one speaker to another. F0 is characterized by a discontinuity in the transition between voiced and unvoiced sounds that present...
COR
2008
13 years 5 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
TIP
2008
13 years 5 months ago
2008
In this paper, we present an automatic classification framework combining appearance based features and Hidden Markov Models (HMM) to detect unusual events in image sequences. One...