{"id":"https://openalex.org/W2139539173","doi":"https://doi.org/10.1145/1068009.1068124","title":"Not all linear functions are equally difficult for the compact genetic algorithm","display_name":"Not all linear functions are equally difficult for the compact genetic algorithm","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2139539173","doi":"https://doi.org/10.1145/1068009.1068124","mag":"2139539173"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and 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/A5091488910","display_name":"Stefan Droste","orcid":"https://orcid.org/0000-0003-1591-9477"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Droste","raw_affiliation_strings":["Universit\u00e4t Dortmund, Dortmund, Germany","[Universitat Dortmund, Dortmund, Germany]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"[Universitat Dortmund, Dortmund, Germany]","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091488910"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":6.3937,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.96445616,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"679","last_page":"686"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9987999796867371,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/edas","display_name":"EDAS","score":0.9686188697814941},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.9048010110855103},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6208422780036926},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5657596588134766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5366491675376892},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4968598186969757},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4937179982662201},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49169594049453735},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.49011096358299255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45329445600509644},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4424903988838196},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.43363410234451294},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.412431001663208},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1286679208278656}],"concepts":[{"id":"https://openalex.org/C49284225","wikidata":"https://www.wikidata.org/wiki/Q5322829","display_name":"EDAS","level":3,"score":0.9686188697814941},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.9048010110855103},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6208422780036926},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5657596588134766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5366491675376892},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4968598186969757},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4937179982662201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49169594049453735},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.49011096358299255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45329445600509644},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4424903988838196},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.43363410234451294},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.412431001663208},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1286679208278656},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1068009.1068124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.7139","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.7139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p679.pdf","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":14,"referenced_works":["https://openalex.org/W19646579","https://openalex.org/W1540706608","https://openalex.org/W1573534773","https://openalex.org/W1574062351","https://openalex.org/W1593495653","https://openalex.org/W1692958259","https://openalex.org/W1966355747","https://openalex.org/W2116832689","https://openalex.org/W2156622046","https://openalex.org/W2165220807","https://openalex.org/W2295428206","https://openalex.org/W2414365832","https://openalex.org/W2911346016","https://openalex.org/W4206478455"],"related_works":["https://openalex.org/W1982259447","https://openalex.org/W2496664933","https://openalex.org/W1503012231","https://openalex.org/W1058439126","https://openalex.org/W2360241151","https://openalex.org/W2547072840","https://openalex.org/W1522658100","https://openalex.org/W2124261928","https://openalex.org/W2047098179","https://openalex.org/W2096498780"],"abstract_inverted_index":{"Estimation":[0],"of":[1,46,59,82,101],"distribution":[2,15],"algorithms":[3],"(EDAs)":[4],"try":[5],"to":[6,35,43],"solve":[7],"an":[8],"optimization":[9],"problem":[10],"by":[11],"finding":[12],"a":[13,25,36,83,99],"probability":[14,37],"focussed":[16],"around":[17],"its":[18],"optima.":[19],"For":[20],"this":[21],"purpose":[22],"they":[23],"conduct":[24],"sampling-evaluation-adjustment":[26],"cycle,":[27],"where":[28],"search":[29],"points":[30],"are":[31,52,62],"sampled":[32,48],"with":[33],"respect":[34],"distribution,":[38],"which":[39],"is":[40],"adjusted":[41],"according":[42],"the":[44,47,57,86,110],"evaluation":[45],"points.":[49],"Although":[50],"there":[51,61],"many":[53],"successful":[54],"experiments":[55],"suggesting":[56],"usefulness":[58],"EDAs,":[60],"only":[63],"few":[64],"rigorous":[65,79],"theoretical":[66],"results":[67,71,102],"apart":[68],"from":[69],"convergence":[70],"without":[72],"time":[73],"bounds.":[74],"Here":[75],"we":[76],"present":[77],"first":[78],"runtime":[80],"analyses":[81],"simple":[84],"EDA,":[85],"compact":[87],"genetic":[88],"algorithm,":[89],"for":[90],"linear":[91,107],"pseudo-boolean":[92],"functions":[93,108],"on":[94],"n":[95],"variables.":[96],"We":[97],"prove":[98],"number":[100],"showing":[103],"that":[104],"not":[105],"all":[106],"have":[109],"same":[111],"asymptotical":[112],"runtime.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}