{"id":"https://openalex.org/W1009103061","doi":null,"title":"Hyper-quicksort: energy efficient sorting via the Templar framework for Template Method Hyper-heuristics","display_name":"Hyper-quicksort: energy efficient sorting via the Templar framework for Template Method Hyper-heuristics","alternate_titles":[],"publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1009103061","mag":"1009103061"},"language":"en","primary_location":{"id":"pmh:oai:eprints.whiterose.ac.uk:88239","doi":null,"is_oa":true,"landing_page_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/","pdf_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/1/hyper_quicksort_energy_efficient_sorting_via_the_templar_framework_for_template_method_hyper_heuristics.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference or Workshop Item"},"parent_works":[],"lineage":["https://openalex.org/W1009103061"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/1/hyper_quicksort_energy_efficient_sorting_via_the_templar_framework_for_template_method_hyper_heuristics.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020241362","display_name":"Jeremiah Swan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jeremiah Swan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044928411","display_name":"Nathan Burles","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Nathan Burles","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0090702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.6190999746322632,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.6190999746322632,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.1445000022649765,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.06939999759197235,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hyper-heuristics","display_name":"hyper-heuristics","score":0.8050000071525574},{"id":"https://openalex.org/keywords/program-synthesis","display_name":"program synthesis","score":0.6869999766349792},{"id":"https://openalex.org/keywords/generative-algorithms","display_name":"generative algorithms","score":0.703000009059906},{"id":"https://openalex.org/keywords/algorithm-scalability","display_name":"algorithm scalability","score":0.33799999952316284}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8118056058883667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7407919764518738},{"id":"https://openalex.org/C2778154381","wikidata":"https://www.wikidata.org/wiki/Q105296908","display_name":"Ingenuity","level":2,"score":0.6980887055397034},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.6975083351135254},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6711995005607605},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.666347086429596},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.5559231042861938},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4539584219455719},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4053480625152588},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3679695725440979},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3506031036376953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.290488064289093},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.whiterose.ac.uk:88239","doi":null,"is_oa":true,"landing_page_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/","pdf_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/1/hyper_quicksort_energy_efficient_sorting_via_the_templar_framework_for_template_method_hyper_heuristics.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference or Workshop Item"},{"id":"mag:1009103061","doi":null,"is_oa":false,"landing_page_url":"http://eprints.whiterose.ac.uk/88239/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:eprints.whiterose.ac.uk:88239","doi":null,"is_oa":true,"landing_page_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/","pdf_url":"https://eprints.whiterose.ac.uk/id/eprint/88239/1/hyper_quicksort_energy_efficient_sorting_via_the_templar_framework_for_template_method_hyper_heuristics.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference or Workshop Item"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1009103061.pdf","grobid_xml":"https://content.openalex.org/works/W1009103061.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1579034591","https://openalex.org/W1977683584","https://openalex.org/W1980900887","https://openalex.org/W2001996675","https://openalex.org/W2153708093","https://openalex.org/W2156589241","https://openalex.org/W2157096679"],"related_works":["https://openalex.org/W654275586","https://openalex.org/W2520292835","https://openalex.org/W2098702582","https://openalex.org/W1597565715","https://openalex.org/W2245544685","https://openalex.org/W1787267157","https://openalex.org/W2467134058","https://openalex.org/W6941606552","https://openalex.org/W4387793213","https://openalex.org/W2054358146"],"abstract_inverted_index":{"Scalability":[0],"remains":[1],"an":[2],"issue":[3],"for":[4],"program":[5],"synthesis:":[6],"-":[7,19,38,46],"We":[8],"don\u2019t":[9],"yet":[10],"know":[11],"how":[12,67],"to":[13,74],"generate":[14],"sizeable":[15],"algorithms":[16],"from":[17],"scratch.":[18],"Generative":[20],"approaches":[21,40],"such":[22],"as":[23],"GP":[24],"still":[25],"work":[26],"best":[27,70],"at":[28],"the":[29],"scale":[30],"of":[31,56],"expressions":[32],"(though":[33],"some":[34],"recent":[35],"promising":[36],"results).":[37],"Formal":[39],"require":[41],"a":[42,53],"strong":[43],"mathematical":[44],"background.":[45],"...":[47],"but":[48],"human":[49],"ingenuity":[50],"already":[51],"provides":[52],"vast":[54],"repertoire":[55],"specialized":[57],"algorithms,":[58],"usually":[59],"with":[60],"known":[61],"asymptotic":[62],"behaviour.":[63],"Given":[64],"these":[65],"limitations,":[66],"can":[68],"we":[69],"use":[71],"generative":[72],"hyper-heuristics":[73],"improve":[75],"upon":[76],"human-designed":[77],"algorithms?":[78]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1009103061","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
