{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T23:32:58Z","timestamp":1718667178238},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":[[1994,10]]},"DOI":"10.1016\/0165-6074(94)90100-7","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:56:10Z","timestamp":1060304170000},"page":"537-552","source":"Crossref","is-referenced-by-count":5,"title":["Genetic algorithm for embedding a complete graph in a hypercube with a VLSI application"],"prefix":"10.1016","volume":"40","author":[{"given":"R.","family":"Chandrasekharam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.V.","family":"Vinod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(94)90100-7_BIB1","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/TEC.1962.5219385","article-title":"A programmed algorithm for assigning internal codes to sequential machines","volume":"EC-11","author":"Armstrong","year":"1962","journal-title":"IRE Trans. Electronic Comput."},{"key":"10.1016\/0165-6074(94)90100-7_BIB2","series-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"Brayton","year":"1984"},{"key":"10.1016\/0165-6074(94)90100-7_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TCAD.1985.1270123","article-title":"Optimal state assignment for finite state machines","volume":"4","author":"DeMicheli","year":"1985","journal-title":"IEEE Trans. Comput. Aided Design"},{"issue":"12","key":"10.1016\/0165-6074(94)90100-7_BIB4","doi-asserted-by":"crossref","first-page":"1290","DOI":"10.1109\/43.16807","article-title":"MUSTANG: State asignment of finite state machines targeting multilevel logic implementation","volume":"7","author":"Devadas","year":"1988","journal-title":"IEEE Trans. Comput. Aided. Design."},{"issue":"1","key":"10.1016\/0165-6074(94)90100-7_BIB5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/43.62789","article-title":"MUSE: A multilevel symbolic encoding algorithm for state assignment","volume":"10","author":"Du","year":"1991","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/0165-6074(94)90100-7_BIB6","series-title":"A Guide to the Theory of NP-Completeness","author":"Gary","year":"1979"},{"issue":"4","key":"10.1016\/0165-6074(94)90100-7_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(89)90118-X","article-title":"Unit length embedding of binary trees on a square grid","volume":"31","author":"Gregori","year":"1989","journal-title":"Informat. Process. Letters"},{"key":"10.1016\/0165-6074(94)90100-7_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TEC.1961.5219184","article-title":"On the state assignment problem for sequential machines","volume":"EC-10","author":"Hartmanis","year":"1961","journal-title":"IRE Trans. Electronic Comput."},{"key":"10.1016\/0165-6074(94)90100-7_BIB9","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/0165-6074(94)90100-7_BIB10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0196-6774(91)90004-I","article-title":"The complexity of congestion-1 embedding in a hypercube","volume":"12","author":"Young Man Kim","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0165-6074(94)90100-7_BIB11","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(94)90100-7_BIB12","series-title":"Hypercube Multiprocessor","author":"Krumme","year":"1986"},{"issue":"6","key":"10.1016\/0165-6074(94)90100-7_BIB13","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/12.90250","article-title":"Placement of processors of a hypercube","volume":"40","author":"Ten-Hwang Lai","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0165-6074(94)90100-7_BIB14","series-title":"Analysis and Design of Parallel Algorithms","author":"Lakshmivarahan","year":"1990"},{"key":"10.1016\/0165-6074(94)90100-7_BIB15","series-title":"Proc. 4th CSI\/IEEE Int. Symp. on VLSI Design","first-page":"45","article-title":"A simulated annealing based state assignment approach for control synthesis","author":"Mitra","year":"1991"},{"issue":"5","key":"10.1016\/0165-6074(94)90100-7_BIB16","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/43.55180","article-title":"A genetic approach to standard cell placement using meta-genetic parameter optimization","volume":"9","author":"Shahookar","year":"1990","journal-title":"IEEE Trans. Comput. Aided Design"},{"issue":"9","key":"10.1016\/0165-6074(94)90100-7_BIB17","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/43.59068","article-title":"NOVA: State assignment of finite state machines for optimal two level logic implementation","volume":"9","author":"Villa","year":"1990","journal-title":"IEEE Trans. Comput. Aided Design"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494901007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494901007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:53:52Z","timestamp":1552600432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607494901007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0165607494901007"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(94)90100-7","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}