{"id":"https://openalex.org/W2165372647","doi":null,"title":"Noise strategies for improving local search","display_name":"Noise strategies for improving local search","publication_year":1994,"publication_date":"1994-10-05","ids":{"openalex":"https://openalex.org/W2165372647","mag":"2165372647"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.5360","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.5360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/%7Edavet/ubcsat/algorithms/SelKauCoh94.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/A5105461279","display_name":"Bart Selman","orcid":"https://orcid.org/0000-0003-0666-3123","observed_orcids":["https://orcid.org/0000-0003-0666-3123"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bart Selman","raw_affiliation_strings":["AT&T Bell Laboratories, Murray Hill, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, NJ#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105508446","display_name":"Henry Kautz","orcid":"https://orcid.org/0000-0001-5219-2970","observed_orcids":["https://orcid.org/0000-0001-5219-2970"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henry Kautz","raw_affiliation_strings":["AT&T Bell Laboratories, Murray Hill, NJ#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-5219-2970","affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, NJ#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000878222","display_name":"Brain Cohen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brain Cohen","raw_affiliation_strings":["AT&T Bell Laboratories, Murray Hill, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, NJ#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":11.7571,"has_fulltext":false,"cited_by_count":757,"citation_normalized_percentile":{"value":0.98707593,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"337","last_page":"343"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9911999702453613,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9911999702453613,"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.004800000227987766,"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.0003000000142492354,"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/local-search","display_name":"local search","score":0.9810000061988831},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9409999847412109},{"id":"https://openalex.org/keywords/random-noise","display_name":"random noise","score":0.8009999990463257},{"id":"https://openalex.org/keywords/cnf-satisfiability","display_name":"CNF satisfiability","score":0.8840000033378601},{"id":"https://openalex.org/keywords/maxsat","display_name":"MaxSAT","score":0.9150000214576721},{"id":"https://openalex.org/keywords/network-synthesis","display_name":"network synthesis","score":0.9929999709129333},{"id":"https://openalex.org/keywords/circuit-diagnosis","display_name":"circuit diagnosis","score":0.8389999866485596},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8040000200271606}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.8200045824050903},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.8130229711532593},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7011082768440247},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6287041902542114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5753839015960693},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5733835697174072},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.5480213761329651},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.437081903219223},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.42938941717147827},{"id":"https://openalex.org/C2986577269","wikidata":"https://www.wikidata.org/wiki/Q11306265","display_name":"Random noise","level":2,"score":0.4258118271827698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.398426353931427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32836809754371643},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3082408905029297},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24306893348693848},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07442465424537659},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"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":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.5360","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.5360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/%7Edavet/ubcsat/algorithms/SelKauCoh94.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.319.7660","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.319.7660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/AAAI/1994/AAAI94-051.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.9892","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://portal.research.bell-labs.com/orgs/ssr/people/kautz/papers-ftp/aaai94loc.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.676.9067","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.9067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fai.cs.uni-saarland.de/teaching/winter12-13/heuristic-search-material/WalkSAT.pdf","raw_type":"text"},{"id":"mag:2165372647","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/1994/AAAI94-051.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","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":21,"referenced_works":["https://openalex.org/W4326551","https://openalex.org/W4983232","https://openalex.org/W45908618","https://openalex.org/W125178576","https://openalex.org/W1513769081","https://openalex.org/W1561608403","https://openalex.org/W1667362966","https://openalex.org/W1667614912","https://openalex.org/W1820801893","https://openalex.org/W2010601719","https://openalex.org/W2024060531","https://openalex.org/W2025399946","https://openalex.org/W2037197578","https://openalex.org/W2040924621","https://openalex.org/W2062897452","https://openalex.org/W2104670598","https://openalex.org/W2153638045","https://openalex.org/W2154303016","https://openalex.org/W2160444875","https://openalex.org/W2408006898","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2404266688","https://openalex.org/W7051961086","https://openalex.org/W1978526866","https://openalex.org/W166744128","https://openalex.org/W6980787658","https://openalex.org/W7100620544","https://openalex.org/W7100102876","https://openalex.org/W1591939288","https://openalex.org/W1764733676","https://openalex.org/W2611301570"],"abstract_inverted_index":{"It":[0],"has":[1],"recently":[2],"been":[3,115],"shown":[4],"that":[5,65,96,140],"local":[6,27,40,81,129],"search":[7,28,44,82,112,130],"is":[8,69],"surprisingly":[9],"good":[10],"at":[11],"finding":[12,137],"satisfying":[13],"assignments":[14],"for":[15,37,85,106,131],"certain":[16],"computationally":[17],"hard":[18],"classes":[19],"of":[20,25,80,136],"CNF":[21],"formulas.":[22],"The":[23],"performance":[24],"basic":[26],"methods":[29,105],"can":[30],"be":[31],"further":[32],"enhanced":[33],"by":[34],"introducing":[35],"mechanisms":[36],"escaping":[38],"from":[39],"minima":[41],"in":[42],"the":[43,70,78,102,134],"space.":[45],"We":[46,63,73],"will":[47],"compare":[48],"three":[49],"such":[50],"mechanisms:":[51],"simulated":[52],"annealing,":[53],"random":[54,61,67,98],"noise,":[55],"and":[56,89,123],"a":[57],"strategy":[58],"called":[59],"\"mixed":[60],"walk\".":[62],"show":[64],"mixed":[66,97],"walk":[68,84,99],"superior":[71],"strategy.":[72],"also":[74],"present":[75],"results":[76],"demonstrating":[77],"effectiveness":[79],"with":[83],"solving":[86,107],"circuit":[87,90],"synthesis":[88],"diagnosis":[91],"problems.":[92,109,121],"Finally,":[93],"we":[94],"demonstrate":[95],"improves":[100],"upon":[101],"best":[103],"known":[104],"MAX-SAT":[108],"Introduction":[110],"Local":[111],"algorithms":[113],"have":[114],"successfully":[116],"applied":[117],"to":[118],"many":[119,143],"optimization":[120],"Hansen":[122],"Jaumard":[124],"(1990)":[125],"describe":[126],"experiments":[127],"using":[128],"MAX-SAT,":[132],"i.e.,":[133],"problem":[135],"an":[138],"assignment":[139],"satisfies":[141],"as":[142,145],"clauses":[144],"possi...":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":27},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":27},{"year":2012,"cited_by_count":29}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}