{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:35:24Z","timestamp":1725554124411},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343790"},{"type":"electronic","value":"9783540343806"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758501_48","type":"book-chapter","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T12:38:01Z","timestamp":1147178281000},"page":"340-347","source":"Crossref","is-referenced-by-count":3,"title":["Landscape Properties and Hybrid Evolutionary Algorithm for Optimum Multiuser Detection Problem"],"prefix":"10.1007","author":[{"given":"Shaowei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuping","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lishan","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_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 Transactions on Information Theory\u00a032, 85\u201396 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01553893","volume":"4","author":"S. Verdu","year":"1989","unstructured":"Verdu, S.: Computational Complexity of Optimal Multiuser Detection. Algorithmica\u00a04, 303\u2013312 (1989)","journal-title":"Algorithmica"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1109\/TCOMM.2002.801493","volume":"50","author":"A. AlRustamani","year":"2002","unstructured":"AlRustamani, A., Vojcic, B.R.: A New Approach to Greedy Multiuser Detection. IEEE Transactions on Communications\u00a050, 1326\u20131336 (2002)","journal-title":"IEEE Transactions on Communications"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/LCOMM.2002.808372","volume":"7","author":"H.S. Lim","year":"2003","unstructured":"Lim, H.S., Rao, M.V.C., Tan, A.W.C., Chuah, H.T.: Mulatiuser Detection for DS-CDMA Systems Using Evolutionary Programming. IEEE Communications Letters\u00a07, 101\u2013103 (2003)","journal-title":"IEEE Communications Letters"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/4234.892195","volume":"4","author":"J. Hu","year":"2000","unstructured":"Hu, J., Blum, R.S.: A Gradient Guided Search Algorithm for Multiuser Detection. IEEE Communications Letters\u00a04, 340\u2013342 (2000)","journal-title":"IEEE Communications Letters"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/LCOMM.2002.808372","volume":"7","author":"H.S. Lim","year":"2003","unstructured":"Lim, H.S., Venkatesh, B.: An Efficient Local Search Heuristics for Asynchronous Multiuser Detection. IEEE Communications Letters\u00a07, 299\u2013330 (2003)","journal-title":"IEEE Communications Letters"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1109\/TWC.2004.834699","volume":"3","author":"P.H. Tan","year":"2004","unstructured":"Tan, P.H., Rasmussen, L.K.: Multiuser Detection in CDMA-A Comparison of Relaxations, Exact, and Heuristic Search Methods. IEEE Transactions on Wireless Communicatons\u00a03, 1802\u20131809 (2004)","journal-title":"IEEE Transactions on Wireless Communicatons"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E.D. Weinberger","year":"1990","unstructured":"Weinberger, E.D.: Correlated and Uncorrelated Fitness Landscapes and How to Tell the Difference. Biological Cybernetics\u00a063, 325\u2013336 (1990)","journal-title":"Biological Cybernetics"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem. IEEE Transactions on Evolutionary Computation\u00a04, 337\u2013352 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"48_CR10","series-title":"Lecture Notes in Physics","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-45692-9_10","volume-title":"Fitness Landscape","author":"P.F. Stadler","year":"2002","unstructured":"Stadler, P.F.: Fitness Landscape. Lecture Notes in Physics, pp. 183\u2013204. Springer, Heidelberg (2002)"},{"key":"48_CR11","first-page":"7","volume-title":"Foundations of Genetic Algorithms","author":"C. Reeves","year":"1995","unstructured":"Reeves, C., Wright, C.: An experimental design perspective on genetic algorithms. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of Genetic Algorithms, vol.\u00a03, pp. 7\u201322. Morgan Kaufmann, San Mateo (1995)"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/4235.843491","volume":"4","author":"B. Naudts","year":"2000","unstructured":"Naudts, B., Kallel, L.: A Comparison of Predictive Measure of Problem Difficulty in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation\u00a04, 1\u201315 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"48_CR13","volume-title":"Multiuser Detection","author":"S. Verdu","year":"1998","unstructured":"Verdu, S.: Multiuser Detection. Cambridge University Press, Cambridge (1998)"},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/26.659484","volume":"46","author":"D. Divsalar","year":"1998","unstructured":"Divsalar, D., Simon, M.K., Raphaeli, D.: Improved Parallel Interference Cancellation for CDMA. IEEE Transactions on Communications\u00a046, 258\u2013268 (1998)","journal-title":"IEEE Transactions on Communications"},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P. Merz","year":"2002","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. Journal of Heuristics\u00a08, 197\u2013213 (2002)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758501_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T19:24:35Z","timestamp":1552505075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758501_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343790","9783540343806"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11758501_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}