{"id":"https://openalex.org/W1890389306","doi":"https://doi.org/10.1109/cec.2004.1331165","title":"Non-deterministic decoding with memory to enhance precision in binary-coded genetic algorithms","display_name":"Non-deterministic decoding with memory to enhance precision in binary-coded genetic algorithms","publication_year":2005,"publication_date":"2005-01-17","ids":{"openalex":"https://openalex.org/W1890389306","doi":"https://doi.org/10.1109/cec.2004.1331165","mag":"1890389306"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1331165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","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/A5067273578","display_name":"Orhan Deng\u0131z","orcid":"https://orcid.org/0000-0002-0458-6016"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"O. Dengiz","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Aubum University, Auburn, AL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Aubum University, Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008283931","display_name":"Gerry Dozier","orcid":null},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Dozier","raw_affiliation_strings":["Department of Computer Science and Engineering, Aubum University, Auburn, AL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Aubum University, Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039757205","display_name":"Alice E. Smith","orcid":"https://orcid.org/0000-0001-8808-0663"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.E. Smith","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Aubum University, Auburn, AL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Aubum University, Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067273578"],"corresponding_institution_ids":["https://openalex.org/I82497590"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08927567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2166","last_page":"2172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9990000128746033,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/decoding-methods","display_name":"Decoding methods","score":0.8358731269836426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7267086505889893},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6529298424720764},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5881528854370117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5791565775871277},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5305196642875671},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5126763582229614},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4621610641479492},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.45405131578445435},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3669204115867615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2760935425758362},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.10069873929023743},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.08319467306137085},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07752716541290283}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8358731269836426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7267086505889893},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6529298424720764},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5881528854370117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5791565775871277},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5305196642875671},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5126763582229614},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4621610641479492},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.45405131578445435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3669204115867615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2760935425758362},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.10069873929023743},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.08319467306137085},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07752716541290283},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":2,"locations":[{"id":"doi:10.1109/cec.2004.1331165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.343.7500","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.343.7500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1587100796","https://openalex.org/W2009157513","https://openalex.org/W2031103608","https://openalex.org/W2054933720","https://openalex.org/W2096411220","https://openalex.org/W2096590200","https://openalex.org/W2167662333","https://openalex.org/W2169243220","https://openalex.org/W2169245194","https://openalex.org/W2396809543","https://openalex.org/W4244234786","https://openalex.org/W4387688680","https://openalex.org/W6629610141","https://openalex.org/W6635127100"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2357077655","https://openalex.org/W2351361564","https://openalex.org/W2144831582","https://openalex.org/W2129423808","https://openalex.org/W4205451769","https://openalex.org/W1976480044","https://openalex.org/W2488124294"],"abstract_inverted_index":{"A":[0],"non-deterministic":[1,31],"decoding":[2,28,32],"algorithm":[3,13],"for":[4],"binary":[5,64],"coded":[6],"genetic":[7],"algorithms":[8],"is":[9,58,82],"presented.":[10],"The":[11],"proposed":[12],"enhances":[14],"the":[15,18,27,40,48,54,63,68,78,86,89],"precision":[16],"of":[17,43,88],"GA":[19],"solutions":[20],"by":[21],"introducing":[22],"a":[23,73],"Gaussian":[24,90],"perturbation":[25],"to":[26,35,61],"function.":[29],"This":[30],"enables":[33],"individuals":[34],"represent":[36],"any":[37],"point":[38],"in":[39],"continuum":[41],"instead":[42],"finite":[44],"discrete":[45],"points.":[46],"As":[47],"generations":[49],"evolve,":[50],"information":[51],"gathered":[52],"from":[53],"most":[55],"fit":[56],"members":[57],"continuously":[59],"used":[60],"rearrange":[62],"representation":[65],"grid":[66],"on":[67],"search":[69,74],"space,":[70],"thus":[71],"establishing":[72],"memory":[75],"such":[76],"that":[77],"best":[79],"known":[80],"individual":[81],"always":[83],"positioned":[84],"at":[85],"center":[87],"offset.":[91]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}