{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:26:27Z","timestamp":1694636787165},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/tevc.2009.2029568","type":"journal-article","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T18:36:54Z","timestamp":1257273414000},"page":"246-251","source":"Crossref","is-referenced-by-count":9,"title":["Automatic Reproduction of a Genius Algorithm: Strassen's Algorithm Revisited by Genetic Search"],"prefix":"10.1109","volume":"14","author":[{"family":"Seunghyun Oh","sequence":"first","affiliation":[]},{"family":"Byung-Ro Moon","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/12.508322","article-title":"genetic algorithm and graph partitioning","volume":"45","author":"bui","year":"1996","journal-title":"IEEE Trans Comput"},{"key":"ref10","first-page":"735","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1969.21"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222678"},{"key":"ref5","author":"goldberg","year":"1989","journal-title":"Genetic Algorithms in Search Optimization and Machine Learning"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"ref2","first-page":"413","article-title":"efficient procedures for using matrix algorithms","author":"fischer","year":"1974","journal-title":"Proc Int l Colloquium Automata Languages and Programming"},{"key":"ref9","first-page":"33","volume":"179","author":"pan","year":"1984","journal-title":"How to multiply matrices faster"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/5438925\/05299113.pdf?arnumber=5299113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:25Z","timestamp":1633910365000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5299113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":11,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2009.2029568","relation":{},"ISSN":["1941-0026","1089-778X"],"issn-type":[{"value":"1941-0026","type":"electronic"},{"value":"1089-778X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}