Finite Action-set Learning Automata
Finite action-set learning automata (FALA) are a class of learning automata for which the number of possible actions is finite or, in more mathematical terms, for which the size of the action-set is finite.
Read more about this topic: Learning Automata
Famous quotes containing the words finite and/or learning:
“All finite things reveal infinitude:”
—Theodore Roethke (1908–1963)
“If you should put a knife into a French girl’s learning it would explode and blow away like an omelette soufflee ...”
—M. E. W. Sherwood (1826–1903)