{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:45Z","timestamp":1725664425351},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:05:17Z","timestamp":1330254317000},"page":"820-831","source":"Crossref","is-referenced-by-count":0,"title":["An efficient mapping heuristic for mesh-connected parallel architectures based on Mean Field Annealing"],"prefix":"10.1007","author":[{"given":"Ismail","family":"Haritao\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"71_CR1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0743-7315(92)90013-D","volume":"10","author":"T. Bultan","year":"1992","unstructured":"Bultan, T., and Aykanat, C., \u201cA new mapping heuristic based on mean field annealing\u201d, Journal of Parallel and Distributed Computing, vol. 10, pp. 292\u2013305, 1992.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"no.3","key":"71_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","volume":"30","author":"S.H. Bokhari","year":"1981","unstructured":"Bokhari, S.H., \u201cOn the mapping problem\u201d, IEEE Trans. Comput., vol. 30, no. 3, pp. 207\u2013214, 1981.","journal-title":"IEEE Trans. Comput."},{"key":"71_CR3","doi-asserted-by":"crossref","unstructured":"Camp, W.J, Plimpton, S.J, Hendrickson, B.A., and Leland, R.W., \u201cMassively parallel methods for Enineering and Science problem\u201d, Communication of ACM, vol. 37, no. 4, April 1994.","DOI":"10.1145\/175276.175279"},{"issue":"no.1","key":"71_CR4","first-page":"1","volume":"17","author":"I.S. Duff","year":"1989","unstructured":"Duff, I.S., and Grius, R.G., \u201cSparse matrix test problems\u201d, ACM Trans. on Matematical software, vol. 17, no. 1, pp. 1\u201314, March 1989.","journal-title":"ACM Trans. on Matematical software"},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"Fiduccia, C. M., and Mattheyses, R. M., \u201cA linear heuristic for improving network partitions\u201d, Proc. Design Automat. Conf., pp. 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"71_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. J. Hopfield","year":"1985","unstructured":"Hopfield, J. J., and Tank, D. W., \u201cNeural Computation of Decisions in Optimization Problems\u201d, Biolog. Cybern., vol. 52, pp. 141\u2013152, 1985.","journal-title":"Biolog. Cybern."},{"key":"71_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"Kernighan, B. W., and Lin, S., \u201cAn efficient heuristic procedure for partitioning graphs\u201d, Bell Syst. Tech. J., vol. 49, pp. 291\u2013307, 1970.","journal-title":"Bell Syst. Tech. J."},{"key":"71_CR8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., \u201cOptimization by simulated annealing\u201d, Science, vol. 220, pp. 671\u2013680, 1983.","journal-title":"Science"},{"key":"71_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, A., Aragon, G.R., McGeoch, L.A., and Scheoven, C., \u201cOptimization by simulated annealing\u201d, Operations Research, vol. 37, no. 6, Nov 1989.","DOI":"10.1287\/opre.37.6.865"},{"key":"71_CR10","first-page":"59","volume":"2","author":"C. Peterson","year":"1988","unstructured":"Peterson, C., and Anderson, J.R., \u201cNeural networks and NP-complete optimization problems; a performance study on the graph bisection problem\u201d, Complex Syst. vol. 2, pp. 59\u201389, 1988.","journal-title":"Complex Syst."},{"issue":"no.1","key":"71_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0129065789000414","volume":"3","author":"C. Peterson","year":"1989","unstructured":"Peterson, C., and Soderberg, B., \u201cA new method for mapping optimization problems onto neural networks\u201d, Int. J. Neural Syst., vol. 3, no. 1, pp. 3\u201322, 1989.","journal-title":"Int. J. Neural Syst."},{"key":"71_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00203001","volume":"62","author":"D. E. Bout Van den","year":"1989","unstructured":"Van den Bout, D. E., and Miller, T. K. \u201cImproving the performance of the Hopfield-Tank neural network through normalization and annealing\u201d, Biolog. Cybern., vol. 62, pp. 129\u2013139, 1989.","journal-title":"Biolog. Cybern."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:43:20Z","timestamp":1687272200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}