{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:29:43Z","timestamp":1725888583786},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319590714"},{"type":"electronic","value":"9783319590721"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59072-1_40","type":"book-chapter","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:41:58Z","timestamp":1496097718000},"page":"337-345","source":"Crossref","is-referenced-by-count":2,"title":["FPGA Implementation of the L Smallest k-Subsets Sum Problem Based on the Finite-Time Convergent Recurrent Neural Network"],"prefix":"10.1007","author":[{"given":"Shenshen","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"40_CR1","volume-title":"Combinatorial Algorithms for Computers and Calculators","author":"A Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.: Combinatorial Algorithms for Computers and Calculators, 2nd edn. Academic Press, New York (1978)","edition":"2"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Wang, H., Ma, Z., Nakayama, I.: Effectiveness of penalty function in solving the subset sum problem. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 422\u2013425 (1996)","DOI":"10.1109\/ICEC.1996.542401"},{"issue":"3","key":"40_CR3","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/TVT.2011.2181550","volume":"61","author":"M Bocus","year":"2012","unstructured":"Bocus, M., Coon, J., Canagarajah, C., Armour, S.M.D., Doufexi, A.M.J.: Per-subcarrier antenna selection for H.264 MGS\/CGS video transmission over cognitive radio networks. IEEE Trans. Veh. Technol. 61(3), 1060\u20131073 (2012)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"40_CR4","volume-title":"Knapsack problems: Algorithms and Computer Interpretations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems: Algorithms and Computer Interpretations. Wiley-Interscience, Hoboken (1990). pp. 105\u2013136"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Chang, W.L.: Quantum algorithms of the subset-sum problem on a quantum computer. In: WASE International Conference on Information Engineering, ICIE 2009, pp. 54\u201357 (2009)","DOI":"10.1109\/ICIE.2009.15"},{"issue":"1","key":"40_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/cpe.3201","volume":"27","author":"L Wan","year":"2015","unstructured":"Wan, L., Li, K.L.J.: GPU implementation of a parallel two-list algorithm for the subset-sum problem. Concurr. Comput. 27(1), 119\u2013145 (2015)","journal-title":"Concurr. Comput."},{"key":"40_CR7","first-page":"13","volume":"149","author":"S Gu","year":"2015","unstructured":"Gu, S., Cui, R.: An efficient algorithm for the subset sum problem based on finite-time convergent recurrent neural network. Neuro Comput. 149, 13\u201321 (2015)","journal-title":"Neuro Comput."},{"issue":"6","key":"40_CR8","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1109\/3468.725357","volume":"28","author":"J Wang","year":"1998","unstructured":"Wang, J.: Primal and dual neural networks for shortest-path routing. IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum. 28(6), 864\u2013869 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum."},{"issue":"4","key":"40_CR9","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TNN.2011.2104979","volume":"22","author":"Q Liu","year":"2011","unstructured":"Liu, Q., Wang, J.: Finite-time convergent recurrent neural network with a hard-limiting activation function for constrained optimization with piecewise-linear objective functions. IEEE Trans. Neural Netw. 22(4), 601\u2013613 (2011)","journal-title":"IEEE Trans. Neural Netw."}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks - ISNN 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59072-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:51:44Z","timestamp":1496098304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59072-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319590714","9783319590721"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59072-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}