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:
“We know then the existence and nature of the finite, because we also are finite and have extension. We know the existence of the infinite and are ignorant of its nature, because it has extension like us, but not limits like us. But we know neither the existence nor the nature of God, because he has neither extension nor limits.”
—Blaise Pascal (1623–1662)
“The best way of learning to be an independent sovereign state is to be an independent sovereign state.”
—Kwame Nkrumah (1900–1972)