2467 search results - page 46 / 494 » Finite State Machines |
112
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
The infinite hidden Markov model is a nonparametric extension of the widely used hidden Markov model. Our paper introduces a new inference algorithm for the infinite Hidden Markov...
103
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
89
Voted
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
124
click to vote
IOLTS
2009
IEEE
15 years 7 months ago
2009
IEEE
— The paper deals with designing fault tolerant finite state machines (FSMs) by nanoelectronic programmable logic arrays (PLAs). Two main critical parameters of the fault toleran...
88
Voted
ICECCS
1998
IEEE
15 years 4 months ago
1998
IEEE
All systems, regardless of how carefully they have been constructed, suffer failures. This paper focuses on developing a formal understanding of failure with respect to system imp...