{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:25:07Z","timestamp":1725560707497},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213673"},{"type":"electronic","value":"9783540246527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24652-7_7","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T15:53:07Z","timestamp":1279813987000},"page":"62-71","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem"],"prefix":"10.1007","author":[{"given":"Betul","family":"Demiroz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haluk","family":"Topcuoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmut","family":"Kandemir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Briggs, P., Cooper, K., Kennedy, K., Torczon, L.: Coloring Heuristics for Register Allocation. In: Proc. of SIGPLAN 89 Conference on Programming Language Design and Implementation, Portland, Oregon, pp. 275\u2013284 (1989)","DOI":"10.1145\/73141.74843"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P. Briggs","year":"1994","unstructured":"Briggs, P., Cooper, K., Torczon, L.: Improvements to Graph Coloring Register Allocation. ACM Transactions on Programming Languages and Systems\u00a016(3), 428\u2013455 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register Allocation and Spilling via Graph Coloring. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 98\u2013105 (1982)","DOI":"10.1145\/800230.806984"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chow, F., Hennessy, J.: Register Allocation by Priority-Based Coloring. In: Proc. of SIGPLAN 84 Symposium on Compiler Construction, Montreal, Quebec, pp. 222\u2013232 (1984)","DOI":"10.1145\/502874.502896"},{"key":"7_CR5","unstructured":"Norman, M.G., Moscato, P.: A Competitive and Cooperative Approach to Complex Combinatorial Search. In: Proc. of the 20th Informatics and Operations Research Meeting, Buenos Aires (August 1991)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Freisleben, B., Merz, P.: A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In: Proc. of the IEEE International Conference on Evolutionary Computation, pp. 616\u2013621 (1996)","DOI":"10.1109\/ICEC.1996.542671"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45365-2_13","volume-title":"Applications of Evolutionary Computing","author":"D.A. Fotakis","year":"2001","unstructured":"Fotakis, D.A., Likothanassis, S.D., Stefanakos, S.K.: An Evolutionary Annealing Approach to Graph Coloring. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 120\u2013129. Springer, Heidelberg (2001)"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New Methods to Color the Vertices of a Graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.-K.: Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"7_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/BFb0056916","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.: A New Genetic Local Search Algorithm for Graph Coloring. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 745\u2013754. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24652-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:50:12Z","timestamp":1605743412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24652-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213673","9783540246527"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24652-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}