We introduce a slightly modiied version of a standard learning automaton and show that this`responsive' learning automata eliminates dominated strategies when playing against an unknown environment. This new automaton has strong convergence properties that are easily analyzed, allowing us to compute explicit bounds for convergence rates. Groups of such automata, interacting via a general game, ...

In this paper, we first introduce a network of learning automata, which we call it as distributed learning automata and then propose some iterative algorithms for solving stochastic shortest path problem. These algorithms use distributed learning automata to find a policy that determines a path from a source node to a destination node with minimal expected cost (length). In these algorithms, at...

In this paper, we propose a distributed learning automata-based algorithm to solve the multicast routing problem in wireless mobile ad-hoc networks. The proposed algorithm estimates the expected relative mobility of each host, by sampling its movement parameters in various epochs, to realistically predict its motion behavior, and takes advantage of the Steiner connected dominating set to form t...

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...

One of the most important issues in web mining is how to find out similarities between web pages. In this paper we propose a method based on distributed learning automata which take advantage of usage data to find out web pages similarities. The idea of the proposed method is that if different users request a couple of pages consistently together, then these pages are likely to correspond to th...