{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:55:54Z","timestamp":1773924954680,"version":"3.50.1"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"China National Science Foundation","award":["61272271"],"award-info":[{"award-number":["61272271"]}]},{"name":"China National Science Foundation","award":["61202383"],"award-info":[{"award-number":["61202383"]}]},{"name":"China National Science Foundation","award":["61332008"],"award-info":[{"award-number":["61332008"]}]},{"name":"Shanghai NSF","award":["12ZR1434000"],"award-info":[{"award-number":["12ZR1434000"]}]},{"name":"U.S. NSF","award":["CMMI-1162482"],"award-info":[{"award-number":["CMMI-1162482"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2014CB340404"],"award-info":[{"award-number":["2014CB340404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/tcyb.2014.2365463","type":"journal-article","created":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T19:45:16Z","timestamp":1415907916000},"page":"2089-2099","source":"Crossref","is-referenced-by-count":38,"title":["Fast and Epsilon-Optimal Discretized Pursuit Learning Automata"],"prefix":"10.1109","volume":"45","author":[{"given":"JunQi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Cheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"MengChu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(03)00179-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/69.298184"},{"key":"ref33","first-page":"24","article-title":"Discretized reward-inaction learning automata","volume":"2","author":"thathachar","year":"1979","journal-title":"J Cybern Inf Sci"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0007737"},{"key":"ref31","author":"poznyak","year":"1997","journal-title":"Learning Automata and Stochastic Optimization"},{"key":"ref30","author":"najim","year":"1994","journal-title":"Learning Automata Theory and Applications"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TSMC.1981.4308659","article-title":"A hierarchical system of learning automata","volume":"11","author":"thathachar","year":"1981","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/21.105092"},{"key":"ref35","first-page":"602","article-title":"A class of rapidly converging algorithms for learning automata","author":"thathachar","year":"1984","journal-title":"Proc IEEE Int Conf Cybern Soc"},{"key":"ref34","first-page":"29","article-title":"Estimator algorithms for learning automata","author":"thathachar","year":"1986","journal-title":"Proc Platinum Jubilee Conf Syst Signal Process"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1080\/17517575.2013.792396"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1080\/17517575.2012.743682"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2204980"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2010.2052041"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5975-6"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2013.2280559"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.1049606"},{"key":"ref29","author":"narendra","year":"1989","journal-title":"Learning Automata An Introduction"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/21.44015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.931507"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.1049614"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.1049616"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2005.07.004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2032528"},{"key":"ref23","article-title":"Learning automata and its application to priority assignment in a queuing system with unknown characteristic","author":"meybodi","year":"1983"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1974.5408453"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(69)90085-5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2013.2272702"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSM.2012.2222945"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2005.859189"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2318898"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2170414"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2159587"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2207453"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2243836"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2170678"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TSMCC.2012.2185226","article-title":"A novel approach to the optimization of refining schedules for crude oil operations in refinery","volume":"42","author":"wu","year":"2012","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/12.75146"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/42005.42018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.1049608"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/21.135704"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/3477.558849"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2030786"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1977.4309623"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1980.4308485"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/0743-7315(86)90013-4","article-title":"Using stochastic learning automata for job scheduling in distributed processing systems","volume":"3","author":"mirchandaney","year":"1986","journal-title":"J Parallel Distrib Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1986.289265"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2032363"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2118749"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(81)90035-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2032155"},{"key":"ref5","article-title":"Learning automata in pattern classification","author":"ramesh","year":"1983"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2027220"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.879012"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2221087"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2032414"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1985.6313407"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07455-9_40"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2011.2164524"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/TNNLS.2014.2298402","article-title":"Gaussian classifier-based evolutionary strategy for multimodal optimization","volume":"25","author":"dong","year":"2014","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1239\/jap\/1346955334","article-title":"On $\\epsilon $ -optimality of the pursuit learning algorithm","volume":"49","author":"ryan","year":"2012","journal-title":"J Appl Probab"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TSMCB.2003.811117","article-title":"A new class of $\\epsilon $ -optimal learning automata","volume":"34","author":"georgios","year":"2004","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0541-1"},{"key":"ref43","first-page":"262","article-title":"On using the theory of regular functions to prove the $\\epsilon $ -optimality of the continuous pursuit learning automaton","author":"zhang","year":"2013","journal-title":"Proc Int Conf Ind Eng Appl Artif Intell Expert Syst"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/7265130\/06955789.pdf?arnumber=6955789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:59:09Z","timestamp":1642003149000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6955789\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":64,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2014.2365463","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}