A NEW EDLA-BASED FRAMEWORK FOR FINDING OPTIMAL STOCHASTIC SUB-GRAPH
Mohamad Reza Meybodi, Mohamad Reza Meybodi · Nashriyyah -i Muhandisi -i Barq va Muhandisi -i Kampyutar -i Iran · 2015
In this paper a new structure of learning automata which is called as extended distributed learning automata (eDLA) is introduced. A new eDLA-based iterative sampling method for finding optimal sub-graph in stochastic graphs is proposed. Some mathematical analysis of the proposed algorithm is presented and the convergence property of the algorithm is studied. Our study shows that the proposed algorithm can be converge to the optimal sub-graph.