Sciweavers

2990 search results - page 319 / 598
» Hidden Markov processes
Sort
View
IUI
2010
ACM
16 years 3 months ago
A POMDP approach to P300-based brain-computer interfaces
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
Jaeyoung Park, Kee-Eung Kim, Sungho Jo
ENTCS
2006
119views more  ENTCS 2006»
15 years 6 months ago
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besid...
Marco Bernardo
ALT
2006
Springer
16 years 3 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
ATAL
2007
Springer
15 years 10 months ago
Interactive dynamic influence diagrams
This paper extends the framework of dynamic influence diagrams (DIDs) to the multi-agent setting. DIDs are computational representations of the Partially Observable Markov Decisio...
Kyle Polich, Piotr J. Gmytrasiewicz
EC
2006
97views ECommerce» more  EC 2006»
15 years 6 months ago
A Step Forward in Studying the Compact Genetic Algorithm
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent pop...
Reza Rastegar, Arash Hariri