๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Multiple response learning automata

โœ Scribed by Economides, A.A.


Book ID
117874231
Publisher
IEEE
Year
1996
Tongue
English
Weight
433 KB
Volume
26
Category
Article
ISSN
1083-4419

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Discretized pursuit learning automata
โœ Oommen, B.J.; Lanctot, J.K. ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Institute of Electrical and Electronics Engineers โš– 970 KB
Asynchronous cellular learning automata
โœ Hamid Beigy; M.R. Meybodi ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 641 KB

Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning a

Learning automata based classifier
โœ Seyed-Hamid Zahiri ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 247 KB
Colonies of learning automata
โœ Verbeeck, K.; Nowe, A. ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› IEEE ๐ŸŒ English โš– 399 KB
Multiple-entry finite automata
โœ Arthur Gill; Lawrence T. Kou ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 686 KB

A multiple-entry finite automaton (mefa) is a finite automaton where any state can serve as an initial state. The reason for studying such automata is that there is a class of regular sets which can be recognized much more economically with a parallel bank of identical mefa's than with conventional