{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T13:13:03Z","timestamp":1723036383259},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":["Computers & Electrical Engineering"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0045-7906(01)00029-5","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T16:31:35Z","timestamp":1038846695000},"page":"327-356","source":"Crossref","is-referenced-by-count":1,"title":["HARD: A hypercube embedding algorithm for state assignment of finite state machines"],"prefix":"10.1016","volume":"29","author":[{"given":"Imtiaz","family":"Ahmad","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0045-7906(01)00029-5_BIB1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1049\/ip-cdt:19951885","article-title":"State assignment of finite state machines using a genetic algorithm","volume":"142","author":"Almaini","year":"1995","journal-title":"IEE Proc Comput Digital Tech"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB2","doi-asserted-by":"crossref","unstructured":"Fiacco AV, McCormick GP. Nonlinear programming sequential unconstrained minimization techniques. New York: Wiley; 1968. SIAM classic in applied mathematics. Philadelphia, PA: SIAM Publications; 1990 (reprint)","DOI":"10.1137\/1.9781611971316"},{"issue":"4","key":"10.1016\/S0045-7906(01)00029-5_BIB3","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/162124.162132","article-title":"State assignment for hardwired VLSI control units","volume":"25","author":"Eschermann","year":"1993","journal-title":"ACM Comput Surv"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB4","unstructured":"Lin B, Newton AR. Synthesis of multiple level logic from symbolic high level description languages. IFIP International Conference on Very Large Scale Integration, 1990. p. 187\u201396"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB5","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 Syst Tech J"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB6","doi-asserted-by":"crossref","unstructured":"Duff C, Saucier G. State assignment based on the reduced dependency theory and recent experimental results. IEEE International Conference on Computer-Aided Design (ICCAD-91), November 1991. p. 222\u20135","DOI":"10.1109\/ICCAD.1991.185237"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB7","doi-asserted-by":"crossref","unstructured":"Fiduccia CM, Mattheyses RM. A linear-time heuristic for improving network partitions. ACM\/IEEE 17th Design Automation Conference, 1982. p. 175\u201381","DOI":"10.1109\/DAC.1982.1585498"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB8","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/TEC.1962.5219385","article-title":"A programmed algorithm for assigning internal code to sequential machines","volume":"EC-13","author":"Armstrong","year":"1962","journal-title":"IRE Trans Electron Comput"},{"issue":"3","key":"10.1016\/S0045-7906(01)00029-5_BIB9","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 Aid Des"},{"issue":"2","key":"10.1016\/S0045-7906(01)00029-5_BIB10","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/12.663772","article-title":"A parallel algorithm for state assignment of finite state machines","volume":"47","author":"Hasteer","year":"1998","journal-title":"IEEE Trans Comput"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1006\/jpdc.1993.1110","article-title":"Hypersphere mapper: a nonlinear programming approach to the hypercube embedding problem","volume":"19","author":"Antonio","year":"1993","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"10.1016\/S0045-7906(01)00029-5_BIB12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1049\/ip-e.1989.0034","article-title":"Efficiency of state assignment methods for PLA-based sequential circuits","volume":"136","author":"Huertas","year":"1989","journal-title":"IEE Proc Comput Digital Tech"},{"issue":"4","key":"10.1016\/S0045-7906(01)00029-5_BIB13","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/21.370202","article-title":"Designing genetic algorithms for the state assignment problem","volume":"25","author":"Amaral","year":"1995","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB14","series-title":"Computers and intractability: a guide to NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB15","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/0165-6074(94)90100-7","article-title":"Genetic algorithm for embedding complete graph in a hypercube with a VLSI application","volume":"40","author":"Chandrasekharam","year":"1994","journal-title":"Microproces Microprogram"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB16","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/TEC.1961.5219265","article-title":"On the state assignment for sequential machines II","volume":"EC-10","author":"Stearns","year":"1961","journal-title":"IRE Trans Electron Comput"},{"issue":"12","key":"10.1016\/S0045-7906(01)00029-5_BIB17","doi-asserted-by":"crossref","first-page":"1290","DOI":"10.1109\/43.16807","article-title":"MUSTANG: state assignment of finite state machines targeting multilevel logic implementations","volume":"7","author":"Devadas","year":"1988","journal-title":"IEEE Trans Comput Aid Des"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB18","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\/S0045-7906(01)00029-5_BIB19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0167-9260(97)00027-8","article-title":"State assignment based on two-dimensional placement and hypercube mapping","volume":"24","author":"Liu","year":"1997","journal-title":"Integration, The VLSI J"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB20","unstructured":"Yang S. Logic synthesis and optimization benchmarks user guide, version 3.0. MCNC, 1991"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB21","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/PGEC.1964.263726","article-title":"The coding of internal states of sequential machines","volume":"EC-11","author":"Dolotta","year":"1964","journal-title":"IRE Trans Electron Comput"},{"issue":"9","key":"10.1016\/S0045-7906(01)00029-5_BIB22","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 Aid Des"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB23","series-title":"Using MPI: portable parallel programming with the message-passing interface","author":"Gropp","year":"1994"},{"key":"10.1016\/S0045-7906(01)00029-5_BIB24","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/0167-8191(96)00024-5","article-title":"A high-performance, portable implementation of the message passing interface standard","volume":"22","author":"Gropp","year":"1996","journal-title":"Parallel Comput"},{"issue":"6","key":"10.1016\/S0045-7906(01)00029-5_BIB25","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF01381720","article-title":"Hypercube embedding heuristics: an evaluation","volume":"18","author":"Chen","year":"1989","journal-title":"Int J Parallel Program"},{"issue":"1","key":"10.1016\/S0045-7906(01)00029-5_BIB26","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 Aid Des"}],"container-title":["Computers & Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790601000295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790601000295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T17:03:46Z","timestamp":1583859826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790601000295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0045790601000295"],"URL":"https:\/\/doi.org\/10.1016\/s0045-7906(01)00029-5","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}