{"id":"https://openalex.org/W2128558052","doi":"https://doi.org/10.1109/cec.2010.5586457","title":"Generating a novel sort algorithm using Reinforcement Programming","display_name":"Generating a novel sort algorithm using Reinforcement Programming","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2128558052","doi":"https://doi.org/10.1109/cec.2010.5586457","mag":"2128558052"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048245665","display_name":"Spencer White","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spencer K. White","raw_affiliation_strings":["WA, USA","27921 NE 152nd St. Duvall, Washington, USA, 98019"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"WA, USA","institution_ids":[]},{"raw_affiliation_string":"27921 NE 152nd St. Duvall, Washington, USA, 98019","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111465095","display_name":"Tony Martinez","orcid":"https://orcid.org/0009-0009-5855-5459"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tony Martinez","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, UT, USA","Computer Science Department, Brigham Young University, Provo, Utah, USA 84602#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]},{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah, USA 84602#TAB#","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065138542","display_name":"George Rudolph","orcid":"https://orcid.org/0009-0001-1047-3683"},"institutions":[{"id":"https://openalex.org/I91036609","display_name":"Citadel","ror":"https://ror.org/01vwr6t80","country_code":"US","type":"education","lineage":["https://openalex.org/I91036609"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George Rudolph","raw_affiliation_strings":["Department of Mathematics and Computer Science, Citadel, Charleston, SC, USA","Department of Mathematics and Computer Science, The Citadel, Charleston, South Carolina, USA 29409"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Citadel, Charleston, SC, USA","institution_ids":["https://openalex.org/I91036609"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Citadel, Charleston, South Carolina, USA 29409","institution_ids":["https://openalex.org/I91036609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14448339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"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":1.0,"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.9983000159263611,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.8070019483566284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7338793277740479},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.71253502368927},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6585811376571655},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6500028371810913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5979424118995667},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.49752429127693176},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4579857587814331},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36047762632369995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20314177870750427},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1492891013622284}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.8070019483566284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7338793277740479},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.71253502368927},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6585811376571655},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6500028371810913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5979424118995667},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49752429127693176},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4579857587814331},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36047762632369995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20314177870750427},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1492891013622284},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2010.5586457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W138562460","https://openalex.org/W162879410","https://openalex.org/W1497256448","https://openalex.org/W1513108299","https://openalex.org/W1538397284","https://openalex.org/W1612556207","https://openalex.org/W1639032689","https://openalex.org/W1646707810","https://openalex.org/W2107726111","https://openalex.org/W2109910161","https://openalex.org/W2121863487","https://openalex.org/W2143435603","https://openalex.org/W2160067530","https://openalex.org/W2169257920","https://openalex.org/W2261054240","https://openalex.org/W2904250082","https://openalex.org/W3011120880","https://openalex.org/W3023540311","https://openalex.org/W4214717370","https://openalex.org/W6605564693","https://openalex.org/W6630778951","https://openalex.org/W6636658889","https://openalex.org/W6680976742","https://openalex.org/W6683935339"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W3033694952","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2994182992","https://openalex.org/W2372558933","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682"],"abstract_inverted_index":{"Reinforcement":[0],"Programming":[1],"(RP)":[2],"is":[3,53,58,93],"a":[4,31,54,126,129,133],"new":[5],"approach":[6,21,39],"to":[7,29,95,120],"automatically":[8],"generating":[9],"algorithms,":[10],"that":[11,44,45,57],"uses":[12],"reinforcement":[13],"learning":[14,84,109],"techniques.":[15],"This":[16],"paper":[17],"describes":[18],"the":[19,67,85,97],"RP":[20,28,38,65,115],"and":[22,74,108,132],"gives":[23],"results":[24,43],"of":[25,90],"experiments":[26],"using":[27],"generate":[30,121],"generalized,":[32],"in-place,":[33],"iterative":[34],"sort":[35,68,86,99],"algorithm.":[36,100],"The":[37,50,101],"improves":[40],"on":[41,83],"earlier":[42],"use":[46],"genetic":[47],"programming":[48],"(GP).":[49],"resulting":[51],"algorithm":[52,56],"novel":[55],"more":[59],"efficient":[60],"than":[61,72,112],"comparable":[62],"sorting":[63],"routines.":[64],"learns":[66],"in":[69],"fewer":[70,76],"iterations":[71],"GP":[73],"with":[75],"resources.":[77],"Results":[78],"establish":[79],"interesting":[80],"empirical":[81],"bounds":[82],"algorithm:":[87],"A":[88],"list":[89],"size":[91],"4":[92],"sufficient":[94],"learn":[96],"generalized":[98],"training":[102],"set":[103],"only":[104],"requires":[105],"one":[106],"element":[107],"took":[110],"less":[111],"200,000":[113],"iterations.":[114],"has":[116],"also":[117],"been":[118],"used":[119],"three":[122],"binary":[123,130,134],"addition":[124],"algorithms:":[125],"full":[127],"adder,":[128],"incrementer,":[131],"adder.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}