198 search results - page 9 / 40 » Learning Unary Automata |
ALT
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
ALT
2010
Springer
15 years 1 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
DBSEC
2010
15 years 1 months ago
2010
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
TSMC
2002
14 years 11 months ago
2002
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
121
click to vote
HCW
1999
IEEE
15 years 4 months ago
1999
IEEE
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...