{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T21:49:08Z","timestamp":1652564948275},"reference-count":19,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0165-6074(90)90222-u","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:14:48Z","timestamp":1062594888000},"page":"85-92","source":"Crossref","is-referenced-by-count":3,"title":["An Occam-based evaluation of a parallel version of simulated annealing"],"prefix":"10.1016","volume":"30","author":[{"given":"Valmir C","family":"Barbosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Cristina S","family":"Boeres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(90)90222-U_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"4598","key":"10.1016\/0165-6074(90)90222-U_BIB2","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\/0165-6074(90)90222-U_BIB3","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"Journal of Chemical Physics"},{"issue":"3","key":"10.1016\/0165-6074(90)90222-U_BIB4","doi-asserted-by":"crossref","first-page":"747","DOI":"10.2307\/1427186","article-title":"Convergence and finite-time behavior of simulated annealing","volume":"18","author":"Mitra","year":"1986","journal-title":"Advances in Applied Probability"},{"key":"10.1016\/0165-6074(90)90222-U_BIB5","series-title":"Workshop on Statistical Physics in Engineering and Biology","article-title":"Optimization by simulated annealing: an experimental evaluation","author":"Aragon","year":"1984"},{"key":"10.1016\/0165-6074(90)90222-U_BIB6","series-title":"Proceedings of the International Conference on Parallel Processing","first-page":"6","article-title":"The traveling salesman problem on a hypercubic, MIMD computer","author":"Felten","year":"1985"},{"issue":"6","key":"10.1016\/0165-6074(90)90222-U_BIB7","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","article-title":"Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images","volume":"PAMI-6","author":"Geman","year":"1984","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/0165-6074(90)90222-U_BIB8","article-title":"Concurrency in Systems with Neighborhood Constraints","author":"Barbosa","year":"1986"},{"key":"10.1016\/0165-6074(90)90222-U_BIB9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0743-7315(89)90067-1","article-title":"A distributed implementation of simulated annealing","volume":"6","author":"Barbosa","year":"1989","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/0165-6074(90)90222-U_BIB10","series-title":"Programming in Occam2","author":"Burns","year":"1988"},{"issue":"8","key":"10.1016\/0165-6074(90)90222-U_BIB11","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/0165-6074(90)90222-U_BIB12","series-title":"Markov Random Fields and their Applications","author":"Kinderman","year":"1980"},{"issue":"1","key":"10.1016\/0165-6074(90)90222-U_BIB13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"10.1016\/0165-6074(90)90222-U_BIB14","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/69558.69560","article-title":"Concurrency in heavily loaded neighborhood-constrained systems","volume":"11","author":"Barbosa","year":"1989","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"10.1016\/0165-6074(90)90222-U_BIB15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","article-title":"Distributed algorithms for generating loop-free routes in networks with frequently changing topology","volume":"COM-29","author":"Gafni","year":"1981","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"10.1016\/0165-6074(90)90222-U_BIB16","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","article-title":"The drinking philosophers problem","volume":"6","author":"Chandy","year":"1984","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0165-6074(90)90222-U_BIB17","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"8","key":"10.1016\/0165-6074(90)90222-U_BIB18","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy, and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Communications of the ACM"},{"key":"10.1016\/0165-6074(90)90222-U_BIB19","series-title":"Proceedings of the Twenty-Fourth Annual Allerton Conference on Communication, Control, and Computing","first-page":"1089","article-title":"Optimal snapshots and the maximum flow in precedence graphs","author":"Gafni","year":"1986"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749090222U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749090222U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T05:21:11Z","timestamp":1551072071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749090222U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":19,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["016560749090222U"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(90)90222-u","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}