{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:18Z","timestamp":1740122718947,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T00:00:00Z","timestamp":1529712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10489-018-1201-7","type":"journal-article","created":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T00:48:10Z","timestamp":1529714890000},"page":"4392-4411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving stochastic nonlinear resource allocation problems using continuous learning automata"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7591-1659","authenticated-orcid":false,"given":"Anis","family":"Yazidi","sequence":"first","affiliation":[]},{"given":"Hugo L.","family":"Hammer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,23]]},"reference":[{"key":"1201_CR1","doi-asserted-by":"crossref","unstructured":"Al Islam AA, Alam SI, Raghunathan V, Bagchi S (2012) Multi-armed bandit congestion control in multi-hop infrastructure wireless mesh networks. In: 2012 IEEE 20th international symposium on modeling, analysis & simulation of computer and telecommunication systems (MASCOTS), pp 31\u201340. IEEE","DOI":"10.1109\/MASCOTS.2012.14"},{"key":"1201_CR2","unstructured":"Black PE (2004) Fractional knapsack problem. Dictionary of algorithms and data structures"},{"issue":"2","key":"1201_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/JSTSP.2013.2246763","volume":"7","author":"J Chen","year":"2013","unstructured":"Chen J, Sayed AH (2013) Distributed pareto optimization via diffusion strategies. IEEE J Sel Top Sign Proces 7(2):205\u2013 220","journal-title":"IEEE J Sel Top Sign Proces"},{"issue":"4","key":"1201_CR4","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean BC, Goemans MX, Vondr\u00e1k J (2008) Approximating the stochastic knapsack problem: The benefit of adaptivity. Math Oper Res 33(4):945\u2013964","journal-title":"Math Oper Res"},{"key":"1201_CR5","doi-asserted-by":"crossref","unstructured":"Ghavipour M, Meybodi MR (2017) Trust propagation algorithm based on learning automata for inferring local trust in online social networks. Knowledge-Based Systems","DOI":"10.1016\/j.knosys.2017.06.034"},{"issue":"3","key":"1201_CR6","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.cor.2009.02.028","volume":"37","author":"MR Gibson","year":"2010","unstructured":"Gibson MR, Ohlmann JW, Fry MJ (2010) An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition. Comput Oper Res 37(3):598\u2013609","journal-title":"Comput Oper Res"},{"issue":"1","key":"1201_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10489-010-0228-1","volume":"33","author":"O-C Granmo","year":"2010","unstructured":"Granmo O-C, Oommen BJ (2010) Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem. Appl Intell 33(1):3\u201320","journal-title":"Appl Intell"},{"issue":"4","key":"1201_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TC.2009.189","volume":"59","author":"O-C Granmo","year":"2010","unstructured":"Granmo O-C, Oommen BJ (2010) Solving stochastic nonlinear resource allocation problems using a hierarchy of twofold resource allocation automata. IEEE Trans Comput 59(4):545\u2013 560","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1201_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","volume":"37","author":"O-C Granmo","year":"2007","unstructured":"Granmo O-C, Oommen BJ, Myrer SA, Olsen MG (2007) Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation. IEEE Trans Syst Man Cybern B Cybern 37(1):166\u2013175","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"issue":"1","key":"1201_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1287\/moor.11.1.9","volume":"11","author":"P Kall","year":"1986","unstructured":"Kall P (1986) Approximation to optimization problems: An elementary review. Math Oper Res 11(1):9\u201318","journal-title":"Math Oper Res"},{"issue":"6","key":"1201_CR11","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/TC.2002.1009148","volume":"51","author":"J Kangasharju","year":"2002","unstructured":"Kangasharju J, Hartanto F, Reisslein M, Ross KW (2002) Distributing layered encoded video through caches. IEEE Trans Comput 51(6):622\u2013636","journal-title":"IEEE Trans Comput"},{"key":"1201_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer Science & Business Media, Berlin"},{"issue":"1","key":"1201_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10479-009-0577-5","volume":"176","author":"S Kosuch","year":"2010","unstructured":"Kosuch S, Lisser A (2010) Upper bounds for the 0-1 stochastic knapsack problem and a b&b algorithm. Ann Oper Res 176(1):77\u201393","journal-title":"Ann Oper Res"},{"issue":"4","key":"1201_CR14","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/opre.1080.0555","volume":"56","author":"GY Lin","year":"2008","unstructured":"Lin GY, Lu Y, Yao DD (2008) The stochastic knapsack revisited: Switch-over policies and dynamic pricing. Oper Res 56(4):945\u2013957","journal-title":"Oper Res"},{"key":"1201_CR15","doi-asserted-by":"crossref","unstructured":"Liu K, Zhao Q, Swami A (2013) Dynamic probing for intrusion detection under resource constraints. In: Proceedings of IEEE international conference on communications, ICC 2013, Budapest, Hungary, June 9-13, 2013, pp 1980\u20131984","DOI":"10.1109\/ICC.2013.6654814"},{"issue":"7","key":"1201_CR16","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1109\/TSMC.2016.2633007","volume":"47","author":"Y-J Liu","year":"2017","unstructured":"Liu Y-J, Lu S, Li D, Tong S (2017) Adaptive controller design-based ablf for a class of nonlinear time-varying state constraint systems. IEEE Trans Syst Man Cybern Syst Hum 47(7):1546\u20131553","journal-title":"IEEE Trans Syst Man Cybern Syst Hum"},{"key":"1201_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.automatica.2017.07.028","volume":"87","author":"Y-J Liu","year":"2018","unstructured":"Liu Y-J, Lu S, Tong S, Chen X, Chen CP, Li D-J (2018) Adaptive control-based barrier lyapunov functions for a class of stochastic nonlinear systems with full state constraints. Automatica 87:83\u201393","journal-title":"Automatica"},{"key":"1201_CR18","doi-asserted-by":"crossref","unstructured":"Ma Z, Wang H, Shi K, Wang X (2018) Learning automata based caching for efficient data access in delay tolerant networks. Wireless Communications and Mobile Computing, 2018","DOI":"10.1155\/2018\/3806907"},{"key":"#cr-split#-1201_CR19.1","unstructured":"Malboubi M, Wang L, Chuah C-N, Sharma P (2014) Intelligent sdn based traffic"},{"key":"#cr-split#-1201_CR19.2","unstructured":"(de) aggregation and measurement paradigm (istamp). In: 2014 Proceedings IEEE INFOCOM, pp 934-942. IEEE"},{"key":"1201_CR20","unstructured":"Narendra KS, Thathachar MAL (2012) Learning automata: an introduction. Courier Corporation"},{"issue":"6","key":"1201_CR21","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/TSMC.1987.6499311","volume":"17","author":"OV Nedzelnitsky","year":"1987","unstructured":"Nedzelnitsky OV, Narendra KS (1987) Nonstationary models of learning automata routing in data communication networks. IEEE Trans Syst Man Cybern 17(6):1004\u20131015","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"1201_CR22","volume-title":"Markov processes and learning models, volume 84","author":"MF Norman","year":"1972","unstructured":"Norman MF (1972) Markov processes and learning models, volume 84. Academic Press, New York"},{"issue":"2","key":"1201_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/1016025","volume":"16","author":"MF Norman","year":"1974","unstructured":"Norman MF (1974) Markovian learning processes. SIAM Rev 16(2):143\u2013162","journal-title":"SIAM Rev"},{"key":"1201_CR24","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/TSMC.1986.289265","volume":"16","author":"BJ Oommen","year":"1986","unstructured":"Oommen BJ (1986) Absorbing and ergodic discretized two action learning automata. IEEE Trans Syst Man Cybern 16:282\u2013293","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"3","key":"1201_CR25","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/TAC.2015.2444131","volume":"61","author":"D Panagou","year":"2016","unstructured":"Panagou D, Stipanovi\u0107 DM, Voulgaris PG (2016) Distributed coordination control for multi-robot networks using lyapunov-like barrier functions. IEEE Trans Autom Control 61(3):617\u2013632","journal-title":"IEEE Trans Autom Control"},{"key":"1201_CR26","doi-asserted-by":"crossref","unstructured":"Pandey S, Ramamritham K, Chakrabarti S (2003) Monitoring the dynamic web to respond to continuous queries. In: Proceedings of the 12th international conference on World Wide Web. ACM, pp 659\u2013668","DOI":"10.1145\/775152.775245"},{"issue":"3","key":"1201_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/90.502239","volume":"4","author":"GI Papadimitriou","year":"1996","unstructured":"Papadimitriou GI, Maritsas DG (1996) Learning automata-based receiver conflict avoidance algorithms for wdm broadcast-and-select star networks. IEEE\/ACM Trans Networking 4(3):407\u2013412","journal-title":"IEEE\/ACM Trans Networking"},{"issue":"3","key":"1201_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/4234.831040","volume":"4","author":"GI Papadimitriou","year":"2000","unstructured":"Papadimitriou GI, Pomportsis AS (2000) Learning-automata-based tdma protocols for broadcast communication systems with bursty traffic. IEEE Commun Lett 4(3):107\u2013109","journal-title":"IEEE Commun Lett"},{"issue":"3","key":"1201_CR29","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1111\/j.1475-3995.2008.00679.x","volume":"16","author":"TC Perry","year":"2009","unstructured":"Perry TC, Hartman JC (2009) An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem. Int Trans Oper Res 16(3):347\u2013359","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"1201_CR30","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TSMCB.2002.1049610","volume":"32","author":"AS Poznyak","year":"2002","unstructured":"Poznyak AS, Najim K (2002) Learning through reinforcement for n-person repeated constrained games. IEEE Trans Syst Man Cybern B Cybern 32(6):759\u2013771","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"1201_CR31","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.knosys.2017.04.012","volume":"127","author":"A Rezvanian","year":"2017","unstructured":"Rezvanian A, Meybodi MR (2017) Sampling algorithms for stochastic graphs: a learning automata approach. Knowl-Based Syst 127:126\u2013144","journal-title":"Knowl-Based Syst"},{"key":"1201_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72428-7","volume-title":"Recent advances in learning automata, volume 754","author":"A Rezvanian","year":"2018","unstructured":"Rezvanian A, Saghiri AM, Vahidipour SM, Esnaashari M, Meybodi MR (2018) Recent advances in learning automata, volume 754. Springer, Berlin"},{"key":"1201_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.jocs.2017.11.012","volume":"24","author":"A Rezvanian","year":"2018","unstructured":"Rezvanian A, Vahidipour SM, Esnaashari M (2018) New applications of learning automata-based techniques in real-world environments. J Comput Sci 24:287\u2013289","journal-title":"J Comput Sci"},{"key":"1201_CR34","doi-asserted-by":"crossref","unstructured":"Ross KW (1995) The stochastic knapsack. In: Multiservice loss models for broadband telecommunication networks, pp 17\u201370. Springer","DOI":"10.1007\/978-1-4471-2126-8_2"},{"key":"1201_CR35","first-page":"79","volume":"32","author":"J Sachs","year":"2006","unstructured":"Sachs J (2006) A stochastic knapsack model for the capacity evaluation of (multi-) radio access networks. Syst Sci 32:79\u201387","journal-title":"Syst Sci"},{"key":"1201_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.10.021","volume":"139","author":"AM Saghiri","year":"2018","unstructured":"Saghiri AM, Meybodi MR (2018) Open asynchronous dynamic cellular learning automata and its application to allocation hub location problem. Knowl-Based Syst 139:149\u2013169","journal-title":"Knowl-Based Syst"},{"key":"1201_CR37","volume-title":"Matrices: theory and applications. Graduate texts in mathematics","author":"D Serre","year":"2002","unstructured":"Serre D (2002) Matrices: theory and applications. Graduate texts in mathematics. Springer, Berlin"},{"key":"1201_CR38","doi-asserted-by":"crossref","unstructured":"Seyyedi SH, Minaei-Bidgoli B (2018) Estimator learning automata for feature subset selection in high-dimensional spaces, case study: Email spam detection. International Journal of Communication Systems","DOI":"10.1002\/dac.3541"},{"issue":"1","key":"1201_CR39","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/0320005","volume":"20","author":"PR Srikantakumar","year":"1982","unstructured":"Srikantakumar PR, Narendra KS (1982) A learning model for routing in telephone networks. SIAM J Control Optim 20(1):34\u201357","journal-title":"SIAM J Control Optim"},{"key":"1201_CR40","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1057\/jors.1979.27","volume":"30","author":"E Steinberg","year":"1979","unstructured":"Steinberg E, Parks MS (1979) A preference order dynamic program for a knapsack problem with stochastic rewards. J Oper Res Soc 30:141\u2013147","journal-title":"J Oper Res Soc"},{"key":"1201_CR41","volume-title":"Automaton theory and modeling of biological systems","author":"ML Tsetlin","year":"1973","unstructured":"Tsetlin ML (1973) Automaton theory and modeling of biological systems. Academic Press, New York"},{"issue":"1","key":"1201_CR42","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10951-014-0401-1","volume":"18","author":"T Wauters","year":"2015","unstructured":"Wauters T, Verbeeck K, De Causmaecker P, Berghe GV (2015) A learning-based optimization approach to multi-project scheduling. J Sched 18(1):61\u201374","journal-title":"J Sched"},{"issue":"1","key":"1201_CR43","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10951-014-0401-1","volume":"18","author":"T Wauters","year":"2015","unstructured":"Wauters T, Verbeeck K, De Causmaecker P, Berghe GV (2015) A learning-based optimization approach to multi-project scheduling. J Sched 18(1):61\u201374","journal-title":"J Sched"},{"key":"1201_CR44","doi-asserted-by":"crossref","unstructured":"Wolf JL, Squillante MS, Yu PS, Sethuraman J, Ozsen L (2002) Optimal crawling strategies for web search engines. In: Proceedings of the 11th international conference on World Wide Web. ACM, pp 136\u2013147","DOI":"10.1145\/511446.511465"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1201-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1201-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1201-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:08:37Z","timestamp":1561230517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1201-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,23]]},"references-count":45,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1201"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1201-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2018,6,23]]},"assertion":[{"value":"23 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}