{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:53Z","timestamp":1757629433060,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0743-7315(92)90013-d","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"292-305","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":57,"title":["A new mapping heuristic based on mean field annealing"],"prefix":"10.1016","volume":"16","author":[{"given":"Tevfik","family":"Bultan","sequence":"first","affiliation":[]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4\u20135","key":"10.1016\/0743-7315(92)90013-D_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(80)90050-2","article-title":"Heuristic algorithms for process assignment in distributed computing systems","volume":"11","author":"Arora","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"12","key":"10.1016\/0743-7315(92)90013-D_BIB2","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/12.9733","article-title":"Iterative algorithms for solution of large sparse systems of linear equations on hypercubes","volume":"37","author":"Aykanat","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0743-7315(92)90013-D_BIB3","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/59.192929","article-title":"Fast decoupled load flow: The hybrid model","volume":"3","author":"Behnam-Guilani","year":"1988","journal-title":"IEEE Trans. Power Systems"},{"issue":"3","key":"10.1016\/0743-7315(92)90013-D_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90013-D_BIB5","first-page":"591","article-title":"Parallel mean field algorithms for the solution of combinatorial optimization problems","volume":"Vol. 1","author":"Bultan","year":"1991"},{"key":"10.1016\/0743-7315(92)90013-D_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/SPDP.1991.218253","article-title":"Circuit partitioning using parallel mean field annealing algorithms","author":"Bultan","year":"1991"},{"key":"10.1016\/0743-7315(92)90013-D_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-7315(90)90004-9","article-title":"Task allocation onto a hypercube by recursive mincut bipartitioning","volume":"10","author":"Er\u00e7al","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(92)90013-D_BIB8","series-title":"Proc. Design Automat. Conf.","first-page":"175","article-title":"A linear heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0743-7315(92)90013-D_BIB9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"\u2018Neural\u2019 computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biolo. Cybernet."},{"key":"10.1016\/0743-7315(92)90013-D_BIB10","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1126\/science.3755256","article-title":"Computing with neural circuits: A model","volume":"233","author":"Hopfield","year":"1986","journal-title":"Science"},{"issue":"6","key":"10.1016\/0743-7315(92)90013-D_BIB11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1038\/scientificamerican1287-104","article-title":"Collective computation in neuronlike circuits","volume":"257","author":"Hopfield","year":"1987","journal-title":"Sci. Amer."},{"issue":"3","key":"10.1016\/0743-7315(92)90013-D_BIB12","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/TSE.1986.6312889","article-title":"Optimal partitioning of randomly generated distributed programs","volume":"12","author":"Indurkhya","year":"1986","journal-title":"IEEE Trans. Software Engrg."},{"issue":"11","key":"10.1016\/0743-7315(92)90013-D_BIB13","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"33","author":"Kasahara","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90013-D_BIB14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0743-7315(92)90013-D_BIB15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0743-7315(92)90013-D_BIB16","doi-asserted-by":"crossref","unstructured":"Lee, S. Y., Chiang, H. D., Lee K. G., Ku B. Y. Parallel power system transient stability analysis on hypercube multiprocessors. IEEE Trans. Power Systems 6, 3, 1337\u20131343.","DOI":"10.1109\/59.119287"},{"key":"10.1016\/0743-7315(92)90013-D_BIB17","first-page":"59","article-title":"Neural networks and NP-complete optimization problems: A performance study on the graph bisection problem","volume":"2","author":"Peterson","year":"1988","journal-title":"Complex Systems"},{"issue":"3","key":"10.1016\/0743-7315(92)90013-D_BIB18","article-title":"A new method for mapping optimization problems onto neural networks","volume":"1","author":"Peterson","year":"1989","journal-title":"Int. J. Neural Systems"},{"key":"10.1016\/0743-7315(92)90013-D_BIB19","first-page":"475","article-title":"Task allocation by simulated annealing","volume":"Vol. III","author":"Ramanujam","year":"1988"},{"issue":"12","key":"10.1016\/0743-7315(92)90013-D_BIB20","first-page":"1408","article-title":"Nearest-neighbor mapping of finite element graphs onto processor meshes","volume":"36","author":"Sadayappan","year":"1989","journal-title":"IEEE Transl. Comput."},{"key":"10.1016\/0743-7315(92)90013-D_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(90)90115-P","article-title":"Cluster partitioning approaches to mapping parallel programs onto a hypercube","volume":"13","author":"Sadayappan","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0743-7315(92)90013-D_BIB22","first-page":"24","article-title":"Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing","volume":"134","author":"Shield","year":"1987"},{"key":"10.1016\/0743-7315(92)90013-D_BIB23","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/ICNN.1988.23942","article-title":"A traveling salesman objective function that works","volume":"Vol. 2","author":"Van den Bout","year":"1988","journal-title":"IEEE Int. Conf. Neural Nets."},{"key":"10.1016\/0743-7315(92)90013-D_BIB24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00203001","article-title":"Improving the performance of the Hopfield-Tank neural network through normalization and annealing","volume":"62","author":"Van den Bout","year":"1989","journal-title":"Bio. Cybernet"},{"issue":"2","key":"10.1016\/0743-7315(92)90013-D_BIB25","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/72.80231","article-title":"Graph partitioning using annealed neural networks","volume":"1","author":"Van den bout","year":"1990","journal-title":"IEEE Trans. Neural Networks."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290013D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290013D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:20Z","timestamp":1757514500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290013D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["074373159290013D"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90013-d","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new mapping heuristic based on mean field annealing","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90013-D","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}