{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:25Z","timestamp":1725560605069},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282273"},{"type":"electronic","value":"9783540319078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538356_101","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:24:05Z","timestamp":1127831045000},"page":"978-987","source":"Crossref","is-referenced-by-count":0,"title":["A Pair-Ant Colony Algorithm for CDMA Multiuser Detector"],"prefix":"10.1007","author":[{"given":"Yao-Hua","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yan-Jun","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yuan-Yuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"101_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TIT.1986.1057121","volume":"32","author":"S. Verdu","year":"1986","unstructured":"Verdu, S.: Minimum probability of error for asynchronous Gaussian multiple access channels. IEEE Trans. Information Theory\u00a032, 85\u201396 (1986)","journal-title":"IEEE Trans. Information Theory"},{"key":"101_CR2","volume-title":"Multiuser Detection","author":"S. Verdu","year":"1998","unstructured":"Verdu, S.: Multiuser Detection. Cambridge University Press, Cambridge (1998)"},{"key":"101_CR3","doi-asserted-by":"crossref","unstructured":"Juntti, M.J., Schlosser, T., Lilleberg, J.O.: Genetic algorithms for multiuser detection in synchronous CDMA. In: Proc. IEEE Information Theory, Germany, p. 492 (1997)","DOI":"10.1109\/ISIT.1997.613429"},{"key":"101_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolutionary. Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Trans. Evolutionary. Computation"},{"key":"101_CR5","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. Stutzle","year":"2000","unstructured":"Stutzle, T., Hoos, H.: MAX-MIN ant system. Future Generation Computer System\u00a016, 889\u2013914 (2000)","journal-title":"Future Generation Computer System"},{"key":"101_CR6","first-page":"1328","volume":"24","author":"B. Wu","year":"2001","unstructured":"Wu, B., Shi, Z.-Z.: An Ant Colony Algorithm Based Partition Algorithm for TSP. Chinese Journal of Computers\u00a024, 1328\u20131333 (2001)","journal-title":"Chinese Journal of Computers"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538356_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:53:40Z","timestamp":1619506420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538356_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282273","9783540319078"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11538356_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}