{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:53:48Z","timestamp":1761918828747},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308188"},{"type":"electronic","value":"9783540315995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596448_34","type":"book-chapter","created":{"date-parts":[[2006,6,17]],"date-time":"2006-06-17T09:12:37Z","timestamp":1150535557000},"page":"238-246","source":"Crossref","is-referenced-by-count":4,"title":["Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning"],"prefix":"10.1007","author":[{"given":"Jing","family":"Liu","sequence":"first","affiliation":[]},{"given":"Weicai","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Licheng","family":"Jiao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Jiao, L., Liu, J., Zhong, W.: An Organizational Coevolutionary Algorithm for Classification. IEEE Trans. Evol. Comput. (2006) (to be published)"},{"key":"34_CR2","unstructured":"http:\/\/www.cse.ucsc.edu\/research\/surf\/GSRC\/progress.html"},{"issue":"2","key":"34_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/43.908471","volume":"20","author":"P.N. Guo","year":"2001","unstructured":"Guo, P.N., Takahashi, T., Cheng, C.K., Yoshimura, T.: Floorplanning Using a Tree Representation. IEEE Trans. CAD\u00a020(2), 281\u2013289 (2001)","journal-title":"IEEE Trans. CAD"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Pang, Y., Cheng, C.K., Yoshimura, T.: An Enhanced Perturbing Algorithm for Floorplan Design using the O-tree Representation. In: Proc. ACM Int. Physical Design Symposia. pp. 168\u2013173 (2000)","DOI":"10.1145\/332357.332395"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Chang, Y.C., Chang, Y.W., Wu, G.M., Wu, S.W.: B*-Trees: a New Representation for Nonslicing Floorplans. In: Proc. ACM\/IEEE Design Automation Conf., pp. 458\u2013463 (2000)","DOI":"10.1145\/337292.337541"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TVLSI.2004.840760","volume":"13","author":"J.M. Lin","year":"2005","unstructured":"Lin, J.M., Chang, Y.W.: TCG: a Transitive Closure Graph-Based Representation for General Floorplans. IEEE Trans. VLSI\u00a013(2), 288\u2013292 (2005)","journal-title":"IEEE Trans. VLSI"},{"issue":"6","key":"34_CR7","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/TCAD.2004.828114","volume":"23","author":"J.M. Lin","year":"2004","unstructured":"Lin, J.M., Chang, Y.W.: TCG-S: Orthogonal Coupling of P*-Admissible Representations for General Floorplans. IEEE Trans. CAD\u00a023(6), 968\u2013980 (2004)","journal-title":"IEEE Trans. CAD"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Tang, X., Wong, D.F.: FAST-SP: a Fast Algorithm for Block Placement based on Sequence Pair. In: Proc. IEEE Asia South Pacific Design Automation Conf., pp. 521\u2013526 (2001)","DOI":"10.1145\/370155.370523"},{"key":"34_CR9","unstructured":"Zhuang, C., Sakanushi, K., Jin, L., Kajitani, Y.: An Enhanced Q-sequence Augmented with Empty-room-insertion and Parenthesis Trees. In: Proc. Design Automation Test Europe, pp. 61\u201368 (2002)"},{"issue":"4","key":"34_CR10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/TCAD.2003.809651","volume":"22","author":"E.F.Y. Young","year":"2003","unstructured":"Young, E.F.Y., Chu, C.C.N., Shen, Z.C.: Twin Binary Sequences: a Nonredundant Representation for General Nonslicing Floorplan. IEEE Trans. CAD\u00a022(4), 457\u2013469 (2003)","journal-title":"IEEE Trans. CAD"},{"issue":"4","key":"34_CR11","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TVLSI.2003.816137","volume":"11","author":"J.M. Lin","year":"2003","unstructured":"Lin, J.M., Chang, Y.W., Lin, S.P.: Corner Sequence - a P-Admissible Floorplan Representation With a Worst Case Linear-time Packing Scheme. IEEE Trans. VLSI\u00a011(4), 679\u2013686 (2003)","journal-title":"IEEE Trans. VLSI"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596448_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:56:02Z","timestamp":1619492162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596448_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308188","9783540315995"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11596448_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}