{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:28:16Z","timestamp":1725492496574},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422334"},{"type":"electronic","value":"9783540457183"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45718-6_23","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:47:30Z","timestamp":1191736050000},"page":"208-216","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Match Fit Algorithm - A Testbed for Computational Motivation of Attention"],"prefix":"10.1007","author":[{"given":"Joseph G.","family":"Billock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Demetri","family":"Psaltis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"key":"23_CR1","first-page":"842","volume":"5","author":"T. Izumi","year":"1998","unstructured":"Izumi, T., Yokomaru, T., Takahashi, A., Kajitani, Y.: Computational complexity analysis of Set-Bin-Packing problem. IEICE Transactions on Fundamentals Of Electronics Communications and Computer Sciences: 5 (1998) 842\u2013849","journal-title":"IEICE Transactions on Fundamentals Of Electronics Communications and Computer Sciences"},{"key":"23_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA. (1979)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M.: Reducibility Among Combinatorial Problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher eds. Plenum Press, NY. 1972 85\u2013104"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S.: Fast Algorithms for Bin-Packing. Journal of Computer Systems Science 8 (1974) 272\u2013314","journal-title":"Journal of Computer Systems Science"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., Graham, R. L.: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM Journal of Computing 3 (1974) 299\u2013326","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/0222004","volume":"22","author":"W. Mao","year":"1993","unstructured":"Mao, W.: Tight Worst-case Performance Bounds for Next-k-Fit Bin Packing. SIAM Journal on Computing 22(1) (1993) 46\u201356","journal-title":"SIAM Journal on Computing"},{"key":"23_CR7","unstructured":"Falkenauer, E.: A Hybrid Grouping Genetic Algorithm for Bin Packing. Working paper CRIF Industrial Management and Automation, CP 106-P4, 50 av. F. D.Roosevelt, B-1050 Brussels, Belgium. (1996)"},{"issue":"6740","key":"23_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature 400(6740) (1999) 133\u2013137","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45718-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:43:10Z","timestamp":1558276990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45718-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422334","9783540457183"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45718-6_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}