{"id":"https://openalex.org/W71699671","doi":"https://doi.org/10.3233/inf-1998-9302","title":"Local Search Efficiency when Optimizing Unimodal Pseudoboolean Functions","display_name":"Local Search Efficiency when Optimizing Unimodal Pseudoboolean Functions","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W71699671","doi":"https://doi.org/10.3233/inf-1998-9302","mag":"71699671"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.513.4063","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.513.4063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mii.lt/Informatica/pdf/INFO118.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5079734959","display_name":"Alexander N. Antamoshkin","orcid":"https://orcid.org/0000-0002-3938-0165","observed_orcids":["https://orcid.org/0000-0002-3938-0165"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u0410. \u041d. \u0410\u043d\u0442\u0430\u043c\u043e\u0448\u043a\u0438\u043d","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3938-0165","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035349875","display_name":"Eugene Stanislavovich Semenkin","orcid":"https://orcid.org/0000-0002-3776-5707","observed_orcids":["https://orcid.org/0000-0002-3776-5707"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eugene Semenkin","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3776-5707","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":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":"9","issue":"3","first_page":"279","last_page":"296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9580000042915344,"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.9580000042915344,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.014399999752640724,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.010700000450015068,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.9440000057220459},{"id":"https://openalex.org/keywords/expected-time-analysis","display_name":"expected time analysis","score":0.6880000233650208},{"id":"https://openalex.org/keywords/convergence-analysis","display_name":"convergence analysis","score":0.6970000267028809}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6465221047401428},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.625340461730957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6017740964889526},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5795491337776184},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5746073722839355},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5341967940330505},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5224146842956543},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.46281754970550537},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4465729594230652},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3418644070625305},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3268362581729889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32553666830062866},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.513.4063","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.513.4063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mii.lt/Informatica/pdf/INFO118.pdf","raw_type":"text"},{"id":"mag:71699671","doi":"https://doi.org/10.3233/inf-1998-9302","is_oa":false,"landing_page_url":"https://www.mii.lt/Informatica/pdf/INFO118.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Informatica","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1975220965","https://openalex.org/W2030398195","https://openalex.org/W2053913299","https://openalex.org/W2115895886","https://openalex.org/W2400370530"],"related_works":["https://openalex.org/W310758491","https://openalex.org/W2118591932","https://openalex.org/W2021333602","https://openalex.org/W735458","https://openalex.org/W1535452087","https://openalex.org/W78405608","https://openalex.org/W2397812677","https://openalex.org/W6928983971","https://openalex.org/W7052066892","https://openalex.org/W1656570009"],"abstract_inverted_index":{"Abstract.":[0],"This":[1],"work":[2],"is":[3],"a":[4,29,34,54],"continuation":[5],"of":[6,13,36,38,49,53,60,71,81,95],"our":[7],"previous":[8],"papers":[9],"devoted":[10],"to":[11],"exploration":[12],"the":[14,26,50,69,78,88],"regular":[15],"search":[16,21,57,106],"procedures":[17,59],"efficiency":[18],"in":[19,28],"binary":[20],"spaces.":[22],"Here":[23],"we":[24],"formulate":[25],"problem":[27,35],"rather":[30],"general":[31,79],"form":[32],"as":[33],"optimization":[37],"an":[39],"unimodal":[40,83,102],"pseudoboolean":[41,103],"function":[42],"given":[43],"implicitly":[44],"and":[45,75],"obtain":[46],"analitical":[47],"estimates":[48,65],"expected":[51],"time":[52],"minimum":[55],"point":[56],"for":[58,68,77,97],"direct":[61],"local":[62,105],"search.":[63],"These":[64],"are":[66],"polinomial":[67],"case":[70,80],"weakly":[72],"nonmonotone":[73],"functions":[74],"exponential":[76],"arbitrary":[82],"functions.":[84],"We":[85],"hope":[86],"that":[87],"proposed":[89],"result":[90],"will":[91],"be":[92],"usefull":[93],"first":[94],"all":[96],"practical":[98],"applications.":[99],"Key":[100],"words:":[101],"functions,":[104],"techniques,":[107],"convergence":[108],"analysis.":[109],"1.":[110]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}