{"id":"https://openalex.org/W4385209709","doi":"https://doi.org/10.1145/3583133.3596380","title":"Neuroevolutionary Compiler Control for Code Optimization","display_name":"Neuroevolutionary Compiler Control for Code Optimization","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385209709","doi":"https://doi.org/10.1145/3583133.3596380"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3596380","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583133.3596380","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596380?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596380?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092528379","display_name":"Kade Heckel","orcid":"https://orcid.org/0009-0009-7021-8834"},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kade Heckel","raw_affiliation_strings":["University of Sussex, Brighton, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Sussex, Brighton, United Kingdom","institution_ids":["https://openalex.org/I162608824"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5092528379"],"corresponding_institution_ids":["https://openalex.org/I162608824"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09685342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2362","last_page":"2365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9786999821662903,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7820796966552734},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7535868883132935},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5944767594337463},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5323197245597839},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.51029372215271},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.49159082770347595},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47219738364219666},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.4207174479961395},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2942870855331421},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.2875196635723114}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7820796966552734},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7535868883132935},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5944767594337463},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5323197245597839},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.51029372215271},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.49159082770347595},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47219738364219666},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.4207174479961395},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2942870855331421},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.2875196635723114},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583133.3596380","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583133.3596380","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596380?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583133.3596380","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583133.3596380","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596380?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385209709.pdf","grobid_xml":"https://content.openalex.org/works/W4385209709.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1518588399","https://openalex.org/W1988425770","https://openalex.org/W2155027007","https://openalex.org/W2156499539","https://openalex.org/W2492794003","https://openalex.org/W2616451375","https://openalex.org/W2778749116","https://openalex.org/W2780624097","https://openalex.org/W3007901542","https://openalex.org/W3008788679","https://openalex.org/W3111356309","https://openalex.org/W3114760331","https://openalex.org/W3120378074","https://openalex.org/W3169291081","https://openalex.org/W3200950867","https://openalex.org/W6741002519"],"related_works":["https://openalex.org/W1606851719","https://openalex.org/W2479014312","https://openalex.org/W1583465708","https://openalex.org/W2004605222","https://openalex.org/W1853049011","https://openalex.org/W2036668966","https://openalex.org/W1713081424","https://openalex.org/W3152373953","https://openalex.org/W1575999420","https://openalex.org/W2158819012"],"abstract_inverted_index":{"The":[0],"optimization":[1,71],"performed":[2],"by":[3],"compilers":[4],"when":[5],"generating":[6],"executable":[7],"programs":[8],"is":[9,21],"critical":[10],"for":[11],"software":[12],"performance":[13,99],"yet":[14],"tuning":[15],"this":[16,51,92],"process":[17],"to":[18,24,50,62,68],"maximize":[19],"efficiency":[20],"difficult":[22],"due":[23],"the":[25,32,42,64,101,107,112],"large":[26],"number":[27,35],"of":[28,36,44,66,111],"possible":[29],"modifications":[30],"and":[31,47,96],"almost":[33],"limitless":[34],"potential":[37],"input":[38],"programs.":[39,76],"To":[40],"promote":[41],"application":[43],"artificial":[45],"intelligence":[46],"machine":[48],"learning":[49,60],"challenge,":[52],"Facebook":[53],"Research":[54],"released":[55],"Compiler":[56],"Gym[1],":[57],"a":[58],"reinforcement":[59],"environment":[61],"allow":[63],"training":[65],"agents":[67],"perform":[69],"compiler":[70],"control":[72],"on":[73,100],"real":[74],"C/C++":[75],"Whereas":[77],"previously":[78],"published":[79],"approaches":[80],"use":[81],"techniques":[82],"such":[83],"as":[84],"Proximal":[85],"Policy":[86],"Optimization":[87],"or":[88],"Deep":[89],"Q":[90],"Networks,":[91],"work":[93],"utilizes":[94],"neuroevolution":[95,113],"achieves":[97],"competitive":[98],"cBench-v1[2]":[102],"program":[103],"set":[104],"while":[105],"demonstrating":[106],"highly":[108],"adaptive":[109],"properties":[110],"approach.":[114]},"counts_by_year":[],"updated_date":"2026-03-07T13:37:22.277990","created_date":"2025-10-10T00:00:00"}
