Sciweavers

2346 search results - page 168 / 470
» Hierarchical State Machines
Sort
View
ICML
2004
IEEE
14 years 11 months ago
Using relative novelty to identify useful temporal abstractions in reinforcement learning
lative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning ?Ozg?ur S?im?sek ozgur@cs.umass.edu Andrew G. Barto barto@cs.umass.edu Department of Computer Scie...
Özgür Simsek, Andrew G. Barto
ICML
2001
IEEE
14 years 11 months ago
Expectation Maximization for Weakly Labeled Data
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
Yuri A. Ivanov, Bruce Blumberg, Alex Pentland
ALT
2005
Springer
14 years 7 months ago
Learnability of Probabilistic Automata via Oracles
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
Omri Guttman, S. V. N. Vishwanathan, Robert C. Wil...
IHM
2004
ACM
14 years 3 months ago
Couplage de ressources d'interaction
Although coupling interaction resources is key to ubiquitous computing, this notion has been overlooked in previous studies. In this paper, we address this notion in a more system...
Nicolas Barralon, Christophe Lachenal, Joëlle...
PTS
2007
97views Hardware» more  PTS 2007»
13 years 11 months ago
Learning and Integration of Parameterized Components Through Testing
Abstract. We investigate the use of parameterized state machine models to drive integration testing, in the case where the models of components are not available beforehand. Theref...
Muzammil Shahbaz, Keqin Li 0002, Roland Groz