{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:06:09Z","timestamp":1725469569654},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372714"},{"type":"electronic","value":"9783540372738"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11816157_65","type":"book-chapter","created":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T11:46:55Z","timestamp":1157024815000},"page":"523-532","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Genetic Algorithm for Cell Placement"],"prefix":"10.1007","author":[{"given":"Guofang","family":"Nan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenlan","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jisong","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"65_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TEPM.2003.813002","volume":"26","author":"R. Kumar","year":"2003","unstructured":"Kumar, R., Luo, Z.: Optimizing The Operation Sequence of A Chip Placement Machine Using TSP Model. IEEE Transactions on Electronics Packaging Manufacturing\u00a026(1), 14\u201321 (2003)","journal-title":"IEEE Transactions on Electronics Packaging Manufacturing"},{"key":"65_CR2","unstructured":"Ishizuka, M., Aida, M.: Achieving Power-law Placement in Wireless Sensor Networks. In: Autonomous Decentralized Systems, 2005. Pro. ISADS 2005, pp. 661\u2013666 (2005)"},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"Alrabady, A.L., Mahud, S.M., Chaudhary, V.: Placement of Resources in the Star Network. In: IEEE Second International Conference on Algorithms and Architectures for Parallel Processing ICAPP (1996)","DOI":"10.1109\/ICAPP.1996.562858"},{"key":"65_CR4","unstructured":"Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the Placement of Web Server Replicas. In: Pro. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 1587\u20131596 (2001)"},{"issue":"3","key":"65_CR5","first-page":"398","volume":"16","author":"A.C. John","year":"1997","unstructured":"John, A.C., Sungho, K.: An Evaluation of Parallel Simulated Annealing Strategies with Application to Standard Cell Placement. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems\u00a016(3), 398\u2013410 (1997)","journal-title":"IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems"},{"key":"65_CR6","doi-asserted-by":"crossref","unstructured":"Terai, M., Takahashi, K., Sato, K.: A New Min-cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constrain. In: Design Automation Conference, pp. 96\u2013102 (1990)","DOI":"10.1145\/123186.123234"},{"key":"65_CR7","unstructured":"Saurabh, A., Igor, M., Villarrubia, P.G.: Improving Min-cut Placement for VLSI Using Analytical Techniques. In: IBM ACAS Conference, pp. 55\u201362 (2003)"},{"issue":"6","key":"65_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TCS.1979.1084652","volume":"26","author":"J.R. Quinn","year":"1979","unstructured":"Quinn, J.R., Breuer, M.A.: A Forced Directed Component Placement Procedure for Printed Circuit Boards. IEEE Trans. CAS\u00a026(6), 377\u2013388 (1979)","journal-title":"IEEE Trans. CAS"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"Suit, S.M., Youssef, H., Barada, H.R., Al-Yamani, A.: A Parallel Tabu Search Algorithm for VLSI standard-cell placement. In: Proceedings of The 2000 IEEE International Symposium on Circuits and Systems (ISCAS 2000), Geneva, vol.\u00a02, pp. 581\u2013584 (2000)","DOI":"10.1109\/ISCAS.2000.856395"},{"key":"65_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MWSCAS.2002.1186811","volume":"2","author":"T.W. Manikas","year":"2002","unstructured":"Manikas, T.W., Mickle, M.H.: A genetic Algorithm for Mixed Macro and Standard Cell Placement. Circuits and Systems\u00a02, 4\u20137 (2002)","journal-title":"Circuits and Systems"},{"key":"65_CR11","doi-asserted-by":"crossref","unstructured":"Shahookar, K., Mazumder, P.: GASP-a Genetic Algorithm for Standard Cell Placement. In: Proceedings of the European Design Automation Conference EDAC 1990, pp. 660\u2013664 (1990)","DOI":"10.1109\/EDAC.1990.136728"},{"key":"65_CR12","unstructured":"Grover, L.K.: A New Simulated Annealing Algorithm for Standard Cell Placement. In: Proc International Conference on CAD, pp. 378\u2013380 (1986)"},{"key":"65_CR13","doi-asserted-by":"crossref","unstructured":"Esbensen, H., Mazumder, P.: SAGA: A Unification of The Genetic Algorithm with Simulated Annealing and Its Application to Macro-cell placement. In: Proceedings of the Seventh International Conference on VLSI Design, pp. 211\u2013214 (1994)","DOI":"10.1109\/ICVD.1994.282687"},{"issue":"8","key":"65_CR14","first-page":"744","volume":"21","author":"B. Yao","year":"2000","unstructured":"Yao, B., Hou, W., Hong, X., Cai, Y.: FAME: A Fast Detailed Placement Algorithm for Standard Cell Layout Based on Mixed Min-cut and Enumeration. Chinese Journal of Semiconductors\u00a021(8), 744\u2013753 (2000)","journal-title":"Chinese Journal of Semiconductors"},{"key":"65_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/11539902_117","volume-title":"Advances in Natural Computation","author":"G. Nan","year":"2005","unstructured":"Nan, G., Li, M., Lin, D., Kou, J.: Adaptive Simulated Annealing for Standard Cell Placement. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol.\u00a03612, pp. 943\u2013947. Springer, Heidelberg (2005)"},{"key":"65_CR16","unstructured":"Areibi, S.: The Effect of Clustering and Local Search on Genetic Algorithms. In: Recent Advances In Soft Computing, Leicester, UK, pp. 172\u2013177 (1999)"},{"key":"65_CR17","doi-asserted-by":"crossref","unstructured":"Kim, C.K., Moon, B.R.: Dynamic Embedding for Genetic VLSI Circuit Partitioning. Engineering Applications of Artificial Intelligence, 67\u201376 (1998)","DOI":"10.1016\/S0952-1976(98)80005-5"},{"key":"65_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1023\/A:1008812214143","volume":"9","author":"B.R. Moon","year":"1998","unstructured":"Moon, B.R., Lee, Y.S., Kim, C.K.: GEORG: VLSI Circuit Partitioner with a New Genetic Algorithm Framework. Journal of Intelligent Manufacturing\u00a09, 401\u2013412 (1998)","journal-title":"Journal of Intelligent Manufacturing"},{"key":"65_CR19","unstructured":"Nan, G., Li, M., Kou, J.: Two Novel Encoding Strategies Based Genetic Algorithms for Circuit Partitioning. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, pp. 2182\u20132188 (2004)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11816157_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:25Z","timestamp":1605644125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11816157_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372714","9783540372738"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11816157_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}