{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T21:24:02Z","timestamp":1726435442734},"reference-count":91,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The goore game (GG) is a model for collective decision making under uncertainty, which can be used as a tool for stochastic optimization of a discrete variable function. The GG has a fascinating property that can be resolved in a distributed manner with no intercommunication between the players. The game has found applications in many network applications, including sensor networks, quality-of-service routing, and social networks. In this paper, we introduce an extension of GG called cellular goore game (CGG) for the first time. The CGG is a network of GGs. In this network, each node (or subset of nodes in the network) plays the rule of referees, each of which participates in a GG with its neighboring players (voters) at any time. Like in GG, each player independently selects its optimal action between two available actions based on their gains and losses received from its adjacent referee. Players in CGG know nothing about how other players are playing or even how\/why they are rewarded\/penalized. The potential of the CGG is shown by providing an algorithm for finding a maximum clique in social networks. Our research provides the first-time study of the CGG for finding a maximum clique in graphs. The performance of the CGG-based algorithm for finding maximum clique is studied on the standard clique benchmark called DIMACS by several experiments. The obtained result shows that the CGG-based algorithm is superior to the existing algorithms in terms of finding maximum clique size and time.<\/jats:p>","DOI":"10.1093\/jcde\/qwac010","type":"journal-article","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T11:16:37Z","timestamp":1653304597000},"page":"966-991","source":"Crossref","is-referenced-by-count":2,"title":["Cellular goore game with application to finding maximum clique in social networks"],"prefix":"10.1093","volume":"9","author":[{"given":"Mohammad Mehdi Daliri","family":"Khomami","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Amirkabir University of Technology, Tehran 1591634311, Iran"}]},{"given":"Mohammad Reza","family":"Meybodi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Amirkabir University of Technology, Tehran 1591634311, Iran"}]},{"given":"Reyhaneh","family":"Ameri","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Amirkabir University of Technology, Tehran 1591634311, Iran"}]}],"member":"286","published-online":{"date-parts":[[2022,5,23]]},"reference":[{"key":"2022052311163179800_bib1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.asoc.2016.12.007","article-title":"Automatic data clustering using continuous action-set learning automata and its application in segmentation of images","volume":"51","author":"Anari","year":"2017","journal-title":"Applied Soft Computing"},{"key":"2022052311163179800_bib2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/IGCC.2011.6008613","article-title":"Gureen Game: An energy-efficient QoS control scheme for wireless sensor networks","volume-title":"2011 International Green Computing Conference and Workshops","author":"Ayers","year":"2011"},{"issue":"3","key":"2022052311163179800_bib3","first-page":"207","article-title":"A branch and bound algorithm for the maximum clique problem","volume":"34","author":"Babel","year":"1990","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"issue":"5","key":"2022052311163179800_bib4","first-page":"523","article-title":"A new effective local search heuristic for the maximum clique problem","volume":"7","author":"Balaji","year":"2013","journal-title":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical and Quantum Engineering"},{"issue":"2","key":"2022052311163179800_bib5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1009646528813","article-title":"Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems","volume":"4","author":"Balas","year":"1998","journal-title":"Journal of Heuristics"},{"issue":"1","key":"2022052311163179800_bib6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.22266\/ijies2018.0228.05","article-title":"Impact of gradient ascent and boosting algorithm in classification","volume":"11","author":"Basha","year":"2018","journal-title":"International Journal of Intelligent Engineering and Systems (IJIES)"},{"issue":"4","key":"2022052311163179800_bib7","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s004530010074","article-title":"Reactive local search for the maximum clique problem 1","volume":"29","author":"Battiti","year":"2001","journal-title":"Algorithmica"},{"key":"2022052311163179800_bib8","first-page":"339","article-title":"A new distributed learning automata-based algorithm for solving stochastic shortest path problem","volume-title":"Proceedings of the 6th Joint Conference on Information Science (JCIS)","author":"Beigy","year":"2002"},{"issue":"1","key":"2022052311163179800_bib9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.cor.2012.06.002","article-title":"Breakout local search for maximum clique problems","volume":"40","author":"Benlic","year":"2013","journal-title":"Computers & Operations Research"},{"key":"2022052311163179800_bib10","doi-asserted-by":"crossref","first-page":"105089","DOI":"10.1016\/j.cor.2020.105089","article-title":"Solving longest common subsequence problems via a transformation to the maximum clique problem","volume":"125","author":"Blum","year":"2020","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2022052311163179800_bib11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1006\/game.1993.1023","article-title":"The statistical mechanics of strategic interaction","volume":"5","author":"Blume","year":"1993","journal-title":"Games and Economic Behavior"},{"issue":"6","key":"2022052311163179800_bib12","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/TEVC.2010.2043363","article-title":"R-EVO: A reactive evolutionary algorithm for the maximum clique problem","volume":"15","author":"Brunato","year":"2011","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"15","key":"2022052311163179800_bib13","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","article-title":"A new trust region technique for the maximum weight clique problem","volume":"154","author":"Busygin","year":"2006","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"2022052311163179800_bib14","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1161\/CIRCULATIONAHA.107.700971","article-title":"Multiple comparisons procedures","volume":"117","author":"Cabral","year":"2008","journal-title":"Circulation"},{"issue":"2","key":"2022052311163179800_bib15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s13173-011-0050-6","article-title":"Branch and bound algorithms for the maximum clique problem under a unified framework","volume":"18","author":"Carmo","year":"2012","journal-title":"Journal of the Brazilian Computer Society"},{"key":"2022052311163179800_bib16","first-page":"1","article-title":"QoS support in wireless sensor networks: A survey","volume-title":"Proceedings of the International Conference on Wireless Networks, ICWN '04","author":"Chen","year":"2004"},{"issue":"2","key":"2022052311163179800_bib17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Mathematical Programming"},{"key":"2022052311163179800_bib18","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1016\/j.procs.2014.05.549","article-title":"Modified gur game for WSNs QoS control","volume":"32","author":"Elshahed","year":"2014","journal-title":"Procedia Computer Science"},{"issue":"1","key":"2022052311163179800_bib21","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1109\/18.651069","article-title":"Greedy and heuristic algorithms for codes and colorings","volume":"44","author":"Etzion","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"2022052311163179800_bib22","doi-asserted-by":"crossref","first-page":"1522","DOI":"10.1109\/WCNC.2004.1311669","article-title":"QoS control for random access wireless sensor networks","volume-title":"2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No. 04TH8733)","author":"Frolik","year":"2004"},{"issue":"22","key":"2022052311163179800_bib23","doi-asserted-by":"crossref","first-page":"5064","DOI":"10.1016\/j.ins.2007.06.009","article-title":"A simple simulated annealing algorithm for the maximum clique problem","volume":"177","author":"Geng","year":"2007","journal-title":"Information Sciences"},{"key":"2022052311163179800_bib24","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1109\/IranianCEE.2017.7985284","article-title":"An extended distributed learning automata-based algorithm for solving the community detection problem in social networks","volume-title":"2017 Iranian Conference on Electrical Engineering (ICEE)","author":"Ghamgosar","year":"2017"},{"key":"2022052311163179800_bib25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.elerap.2016.10.002","article-title":"An adaptive fuzzy recommender system based on learning automata","volume":"20","author":"Ghavipour","year":"2016","journal-title":"Electronic Commerce Research and Applications"},{"issue":"4","key":"2022052311163179800_bib26","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10489-012-0346-z","article-title":"Accelerated Bayesian learning for decentralized two-armed bandit-based decision making with applications to the Goore game","volume":"38","author":"Granmo","year":"2013","journal-title":"Applied Intelligence"},{"issue":"2","key":"2022052311163179800_bib27","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1080\/07474946.2012.665685","article-title":"Achieving unbounded resolution in finite player goore games using stochastic automata, and its applications","volume":"31","author":"Granmo","year":"2012","journal-title":"Sequential Analysis"},{"issue":"2","key":"2022052311163179800_bib28","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:HEUR.0000026264.51747.7f","article-title":"Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem","volume":"10","author":"Grosso","year":"2004","journal-title":"Journal of Heuristics"},{"key":"2022052311163179800_bib29","doi-asserted-by":"crossref","first-page":"108360","DOI":"10.1109\/ACCESS.2019.2933383","article-title":"MEAMCP: A membrane evolutionary algorithm for solving maximum clique problem","volume":"7","author":"Guo","year":"2019","journal-title":"IEEE Access"},{"issue":"4","key":"2022052311163179800_bib30","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01096415","article-title":"Test case generators and computational results for the maximum clique problem","volume":"3","author":"Hasselberg","year":"1993","journal-title":"Journal of Global Optimization"},{"key":"2022052311163179800_bib32","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/ICC.2003.1204230","article-title":"QoS control for sensor networks","volume-title":"IEEE International Conference on Communications, 2003. ICC\u201903","author":"Iyer","year":"2003"},{"key":"2022052311163179800_bib33","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.engappai.2014.08.007","article-title":"General swap-based multiple neighborhood tabu search for the maximum independent set problem","volume":"37","author":"Jin","year":"2015","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2022052311163179800_bib34","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among combinatorial problems","volume-title":"Complexity of computer computations","author":"Karp","year":"1972"},{"key":"2022052311163179800_bib35","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1145\/967900.968107","article-title":"Solving the maximum clique problem by k-opt local search","volume-title":"Proceedings of the 2004 ACM Symposium on Applied Computing","author":"Katayama","year":"2004"},{"issue":"5","key":"2022052311163179800_bib36","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2005.05.010","article-title":"An effective local search for the maximum clique problem","volume":"95","author":"Katayama","year":"2005","journal-title":"Information Processing Letters"},{"key":"2022052311163179800_bib37","volume-title":"Cellular goore game and its applications, Technical report","author":"Khomami","year":"2020"},{"issue":"8","key":"2022052311163179800_bib39","doi-asserted-by":"crossref","first-page":"1650042","DOI":"10.1142\/S0217979216500429","article-title":"Distributed learning automata-based algorithm for community detection in complex networks","volume":"30","author":"Khomami","year":"2016","journal-title":"International Journal of Modern Physics B"},{"issue":"3","key":"2022052311163179800_bib38","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s10489-017-0987-z","article-title":"Minimum positive influence dominating set and its application in influence maximization: A learning automata approach","volume":"48","author":"Khomami","year":"2018","journal-title":"Applied Intelligence"},{"key":"2022052311163179800_bib40","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.jocs.2017.10.009","article-title":"A new cellular learning automata-based algorithm for community detection in complex social networks","volume":"24","author":"Khomami","year":"2018","journal-title":"Journal of Computational Science"},{"key":"2022052311163179800_bib41","first-page":"32","article-title":"A simple and efficient algorithm for the maximum clique finding reusing a heuristic vertex colouring","volume-title":"IADIS International Journal on Computer Science and Information System","author":"Kumlander","year":"2006"},{"key":"2022052311163179800_bib42","first-page":"128","article-title":"An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem","volume-title":"Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI'10)","author":"Li","year":"2010"},{"key":"2022052311163179800_bib43","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.sigpro.2015.11.021","article-title":"Estimator goore game-based quality of service control with incomplete information for wireless sensor networks","volume":"126","author":"Li","year":"2016","journal-title":"Signal Processing"},{"issue":"7","key":"2022052311163179800_bib44","doi-asserted-by":"crossref","first-page":"2693","DOI":"10.1109\/TSMC.2018.2826555","article-title":"We know who you are: Discovering similar groups across multiple social networks","volume":"50","author":"Liu","year":"2018","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"2022052311163179800_bib45","first-page":"112","article-title":"Genetic, iterated and multistart local search for the maximum clique problem","volume-title":"Workshops on Applications of Evolutionary Computation","author":"Marchiori","year":"2002"},{"issue":"2","key":"2022052311163179800_bib46","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.geb.2012.03.006","article-title":"Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation","volume":"75","author":"Marden","year":"2012","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"2022052311163179800_bib47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-013-0075-9","article-title":"Speeding up branch and bound algorithms for solving the maximum clique problem","volume":"59","author":"Maslov","year":"2014","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"2022052311163179800_bib48","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1137\/S1052623400381413","article-title":"A complementary pivoting approach to the maximum weight clique problem","volume":"12","author":"Massaro","year":"2002","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2022052311163179800_bib49","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/TCYB.2017.2655511","article-title":"Compressive-sensing-based structure identification for multilayer networks","volume":"48","author":"Mei","year":"2017","journal-title":"IEEE Transactions on Cybernetics"},{"key":"2022052311163179800_bib50","first-page":"1","volume-title":"Convergence of Q-learning: A simple proof, Technical report","author":"Melo","year":"2001"},{"key":"2022052311163179800_bib51","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.physa.2016.03.102","article-title":"Link prediction based on temporal similarity metrics using continuous action set learning automata","volume":"460","author":"Moradabadi","year":"2016","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"2022052311163179800_bib52","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.engappai.2017.12.006","article-title":"Link prediction in weighted social networks using learning automata","volume":"70","author":"Moradabadi","year":"2018","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2022052311163179800_bib53","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"2022052311163179800_bib54","volume-title":"Learning automata: An introduction","author":"Narendra","year":"2012"},{"key":"2022052311163179800_bib55","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-92157-8_23","article-title":"A dynamic energy-aware algorithm for self-optimizing wireless sensor networks","volume-title":"International Workshop on Self-Organizing Systems","author":"Nayer","year":"2008"},{"key":"2022052311163179800_bib56","first-page":"183","article-title":"Learning automata-based solutions to the Goore game and its applications","volume-title":"Game theory: Strategies, equilibria, and theorems","author":"Oommen","year":"2009"},{"key":"2022052311163179800_bib57","first-page":"1252","article-title":"Empirical verification of a strategy for unbounded resolution in finite player goore games","volume-title":"Australasian Joint Conference on Artificial Intelligence","author":"Oommen","year":"2006"},{"key":"2022052311163179800_bib58","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/CIG.2007.368093","article-title":"Using stochastic AI techniques to achieve unbounded resolution in finite player goore games and its applications","volume-title":"2007 IEEE Symposium on Computational Intelligence and Games","author":"Oommen","year":"2007"},{"issue":"3","key":"2022052311163179800_bib59","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s11265-015-1027-z","article-title":"Heuristic search space generation for maximum clique problem inspired in biomolecular filtering","volume":"83","author":"Ord\u00f3\u00f1ez-Guill\u00e9n","year":"2016","journal-title":"Journal of Signal Processing Systems"},{"issue":"3","key":"2022052311163179800_bib60","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10878-006-9635-y","article-title":"Phased local search for the maximum clique problem","volume":"12","author":"Pullan","year":"2006","journal-title":"Journal of Combinatorial Optimization"},{"key":"2022052311163179800_bib61","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","article-title":"Dynamic local search for the maximum clique problem","volume":"25","author":"Pullan","year":"2006","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"2022052311163179800_bib62","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10732-010-9131-5","article-title":"Cooperating local search for the maximum clique problem","volume":"17","author":"Pullan","year":"2011","journal-title":"Journal of Heuristics"},{"key":"2022052311163179800_bib63","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.future.2017.09.049","article-title":"A learning automata-based ensemble resource usage prediction algorithm for cloud computing environment","volume":"79","author":"Rahmanian","year":"2018","journal-title":"Future Generation Computer Systems"},{"key":"2022052311163179800_bib64","first-page":"634","article-title":"Solving the maximum clique problem with constraint programming","volume-title":"Proceedings of CPAIOR","author":"Regin","year":"2003"},{"issue":"01","key":"2022052311163179800_bib65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218488515500014","article-title":"Finding maximum clique in stochastic graphs using distributed learning automata","volume":"23","author":"Rezvanian","year":"2015","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"issue":"8","key":"2022052311163179800_bib66","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1080\/01969722.2015.1082407","article-title":"Finding minimum vertex covering in stochastic graphs: A learning automata approach","volume":"46","author":"Rezvanian","year":"2015","journal-title":"Cybernetics and Systems"},{"key":"2022052311163179800_bib67","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.chb.2016.07.032","article-title":"Stochastic graph as a model for social networks","volume":"64","author":"Rezvanian","year":"2016","journal-title":"Computers in Human Behavior"},{"key":"2022052311163179800_bib69","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.physa.2013.11.015","article-title":"Sampling from complex networks using distributed learning automata","volume":"396","author":"Rezvanian","year":"2014","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2022052311163179800_bib68","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-030-10767-3_7","article-title":"Social trust management","volume-title":"Learning automata approach for social networks","author":"Rezvanian","year":"2019"},{"issue":"2","key":"2022052311163179800_bib70","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10489-017-0946-8","article-title":"An adaptive super-peer selection algorithm considering peers capacity utilizing asynchronous dynamic cellular learning automata","volume":"48","author":"Saghiri","year":"2018","journal-title":"Applied Intelligence"},{"key":"2022052311163179800_bib71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ISCC.2015.7479334","article-title":"Skip game: An autonomic approach for QoS and energy management in IEEE 802.15. 4 WSN","volume-title":"2015 IEEE Symposium on Computers and Communication (ISCC)","author":"Semprebom","year":"2015"},{"key":"2022052311163179800_bib72","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/INDIN.2013.6622871","article-title":"Energy consumption and spatial diversity trade-off in autonomic wireless sensor networks: The (m, k)-Gur game approach","volume-title":"2013 11th IEEE International Conference on Industrial Informatics (INDIN)","author":"Semprebom","year":"2013"},{"issue":"2","key":"2022052311163179800_bib74","first-page":"18","article-title":"Survey of algorithms on maximum clique problem","volume":"2","author":"Singh","year":"2015","journal-title":"International Advanced Research Journal in Science, Engineering and Technology"},{"issue":"3","key":"2022052311163179800_bib73","first-page":"685","article-title":"Target-aware local search for maximum clique problem","volume":"4","author":"Singh","year":"2014","journal-title":"IFRSA's International Journal of Computing"},{"key":"2022052311163179800_bib75","first-page":"58","article-title":"Finding a maximum clique using ant colony optimization and particle swarm optimization in social networks","author":"Soleimani-Pouri","year":"2012","journal-title":"Proceedings of 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining ( ASONAM '12)"},{"issue":"6","key":"2022052311163179800_bib76","doi-asserted-by":"crossref","first-page":"68004","DOI":"10.1209\/0295-5075\/123\/68004","article-title":"A dynamic message-passing approach for social contagion in time-varying multiplex networks","volume":"123","author":"Su","year":"2018","journal-title":"EPL (Europhysics Letters)"},{"issue":"1","key":"2022052311163179800_bib79","first-page":"47","article-title":"Solution of goore game using modules of stochastic learning automata","volume":"77","author":"Thathachar","year":"1997","journal-title":"Journal of the Indian Institute of Sciences"},{"issue":"1","key":"2022052311163179800_bib77","first-page":"47","article-title":"Solution of Goore game using modules of stochastic learning automata","volume":"77","author":"Thathachar","year":"2013","journal-title":"Journal of the Indian Institute of Science"},{"key":"2022052311163179800_bib78","volume-title":"Networks of learning automata: Techniques for online stochastic optimization","author":"Thathachar","year":"2011"},{"issue":"1","key":"2022052311163179800_bib80","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","article-title":"An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments","volume":"37","author":"Tomita","year":"2007","journal-title":"Journal of Global Optimization"},{"issue":"5","key":"2022052311163179800_bib81","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.comnet.2009.10.007","article-title":"An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata","volume":"54","author":"Torkestani","year":"2010","journal-title":"Computer Networks"},{"key":"2022052311163179800_bib82","volume-title":"Automaton theory and modeling of biological systems","author":"Tsetlin","year":"1973"},{"issue":"4","key":"2022052311163179800_bib83","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/71.494637","article-title":"Using finite state automata to produce self-optimization and self-control","volume":"7","author":"Tung","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"03","key":"2022052311163179800_bib84","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1142\/S0218488517500180","article-title":"Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets","volume":"25","author":"Vahidipour","year":"2017","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"2022052311163179800_bib85","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1109\/INFOCOM.2019.8737443","article-title":"Dynamic spectrum management in 5G wireless networks: A real-life modeling approach","volume-title":"IEEE INFOCOM 2019 \u2013 IEEE Conference on Computer Communications","author":"Vamvakas","year":"2019"},{"issue":"3","key":"2022052311163179800_bib86","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1109\/TCSI.2018.2877414","article-title":"Synchronization of multi-layer networks: From node-to-node synchronization to complete synchronization","volume":"66","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"issue":"3\u20134","key":"2022052311163179800_bib87","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00992698","article-title":"Q-learning","volume":"8","author":"Watkins","year":"1992","journal-title":"Machine Learning"},{"issue":"2182","key":"2022052311163179800_bib88","doi-asserted-by":"crossref","first-page":"20190593","DOI":"10.1098\/rsta.2019.0593","article-title":"Learning automata-based energy-efficient AI hardware design for IoT applications","volume":"378","author":"Wheeldon","year":"2020","journal-title":"Philosophical Transactions of the Royal Society A"},{"issue":"1","key":"2022052311163179800_bib89","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s10878-011-9437-8","article-title":"An adaptive multistart tabu search approach to solve the maximum clique problem","volume":"26","author":"Wu","year":"2013","journal-title":"Journal of Combinatorial Optimization"},{"key":"2022052311163179800_bib90","article-title":"Finite-time analysis for double Q-learning","volume-title":"Advances in neural information processing systems","author":"Xiong","year":"2020"},{"issue":"S1","key":"2022052311163179800_bib91","doi-asserted-by":"crossref","first-page":"S18","DOI":"10.1186\/1471-2105-12-S1-S18","article-title":"Enhanced stochastic optimization algorithm for finding effective multi-target therapeutics","volume":"12","author":"Yoon","year":"2011","journal-title":"BMC Bioinformatics [Electronic Resource]"},{"key":"2022052311163179800_bib92","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/ICNC.2014.6975933","article-title":"A fast genetic algorithm for solving the maximum clique problem","volume-title":"2014 10th International Conference on Natural Computation (ICNC)","author":"Zhang","year":"2014"},{"issue":"2","key":"2022052311163179800_bib93","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10115-011-0476-3","article-title":"A new immune genetic algorithm based on uniform design sampling","volume":"31","author":"Zhou","year":"2012","journal-title":"Knowledge and Information Systems"},{"issue":"11","key":"2022052311163179800_bib94","doi-asserted-by":"crossref","first-page":"4807","DOI":"10.1109\/TSMC.2018.2866704","article-title":"Synchronization analysis for stochastic delayed multilayer network with additive couplings","volume":"50","author":"Zhuang","year":"2018","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/3\/966\/43796119\/qwac010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/3\/966\/43796119\/qwac010.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T11:18:15Z","timestamp":1653304695000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/9\/3\/966\/6590611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":91,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5,23]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwac010","relation":{},"ISSN":["2288-5048"],"issn-type":[{"value":"2288-5048","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,6]]},"published":{"date-parts":[[2022,5,23]]}}}