On expediency of Closed Asynchronous Dynamic Cellular Learning Automata

被引:1
|
作者
Saghiri, Ali Mohammad [1 ]
Meybodi, Mohammad Reza [1 ]
机构
[1] Amirkabir Univ Technol, Comp Engn & Informat Technol Dept, Soft Comp Lab, 424 Hafez Ave, Tehran, Iran
关键词
Cellular Automata; Learning Automata; Closed Asynchronous Dynamic Cellular; Expediency; STOCHASTIC GRAPHS; NETWORKS; ALGORITHM;
D O I
10.1016/j.jocs.2017.08.015
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Closed Asynchronous Dynamic Cellular Learning Automata (CADCLAs) have been reported recently. CADCLAs are hybrid models based on Cellular Automata (CAs) and Learning Automata (LAs). Because of distributed computation characteristic of CAs and probabilistic decision making nature of LAs, analyzing the performance of CADCLA based algorithms is difficult. The expediency metric has been used to study the performance of the LA based models. With respect to this metric, the performance of CADCLAs have not been studied in the literature. In this paper, we suggest sufficient conditions under them a CADCLA is expedient. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:371 / 378
页数:8
相关论文
共 50 条
  • [31] Asynchronous cellular automata and dynamical properties
    Manzoni, Luca
    [J]. NATURAL COMPUTING, 2012, 11 (02) : 269 - 276
  • [32] Foreword: asynchronous cellular automata and applications
    Dennunzio, Alberto
    Fates, Nazim
    Formenti, Enrico
    [J]. NATURAL COMPUTING, 2013, 12 (04) : 537 - 538
  • [33] ASYNCHRONOUS CELLULAR AUTOMATA FOR INFINITE TRACES
    GASTIN, P
    PETIT, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 583 - 594
  • [34] Asynchronous Cellular Automata and Pattern Classification
    Sethi, Biswanath
    Roy, Souvik
    Das, Sukanta
    [J]. COMPLEXITY, 2016, 21 (S1) : 370 - 386
  • [35] m-Asynchronous Cellular Automata
    Dennunzio, Alberto
    Formenti, Enrico
    Manzoni, Luca
    Mauri, Giancarlo
    [J]. CELLULAR AUTOMATA, ACRI 2012, 2012, 7495 : 653 - 662
  • [36] Coxeter Groups and Asynchronous Cellular Automata
    Macauley, Matthew
    Mortveit, Henning S.
    [J]. CELLULAR AUTOMATA, 2010, 6350 : 409 - +
  • [37] A Guided Tour of Asynchronous Cellular Automata
    Fates, Nazim
    [J]. JOURNAL OF CELLULAR AUTOMATA, 2014, 9 (5-6) : 387 - 416
  • [38] Formalization of asynchronous cellular automata using asynchronous protocol for communications
    Lee, Jia
    Peper, Ferdinand
    Leibnitz, Kenji
    [J]. 2018 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2018), 2018, : 38 - 41
  • [39] An adaptive super-peer selection algorithm considering peers capacity utilizing asynchronous dynamic cellular learning automata
    Ali Mohammad Saghiri
    Mohammad Reza Meybodi
    [J]. Applied Intelligence, 2018, 48 : 271 - 299
  • [40] An adaptive super-peer selection algorithm considering peers capacity utilizing asynchronous dynamic cellular learning automata
    Saghiri, Ali Mohammad
    Meybodi, Mohammad Reza
    [J]. APPLIED INTELLIGENCE, 2018, 48 (02) : 271 - 299