{"id":"https://openalex.org/W115698393","doi":null,"title":"Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search","display_name":"Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W115698393","mag":"115698393"},"language":"en","primary_location":{"id":"mag:115698393","doi":null,"is_oa":false,"landing_page_url":"http://webdoc.sub.gwdg.de/univerlag/2010/mkwi/03_anwendungen/planen_scheduling/05_finding_the_needle_in_the_haystack.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W115698393"],"child_works_count":0,"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/A5058729606","display_name":"Stefan Edelkamp","orcid":"https://orcid.org/0000-0001-8435-5025","observed_orcids":["https://orcid.org/0000-0001-8435-5025"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Stefan Edelkamp","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087166877","display_name":"Peter Kissmann","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Peter Kissmann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052242261","display_name":"Damian Sulewski","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Damian Sulewski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004921523","display_name":"Hartmut Messerschmidt","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Hartmut Messerschmidt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7428,"has_fulltext":false,"cited_by_count":8,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.84126489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2295","last_page":"2308"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.989300012588501,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.989300012588501,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.003000000026077032,"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.0020000000949949026,"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/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.8949999809265137},{"id":"https://openalex.org/keywords/uct","display_name":"UCT","score":0.8679999709129333},{"id":"https://openalex.org/keywords/large-state-spaces","display_name":"large state spaces","score":0.6579999923706055},{"id":"https://openalex.org/keywords/lookahead","display_name":"lookahead","score":0.5709999799728394},{"id":"https://openalex.org/keywords/symmetry-detection","display_name":"symmetry detection","score":0.9440000057220459},{"id":"https://openalex.org/keywords/parallel-search","display_name":"parallel search","score":0.9959999918937683}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6472322940826416},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.5716199278831482},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.47069501876831055},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46654319763183594},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4581746757030487},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4349879026412964},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4225846827030182},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.41363537311553955},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38843250274658203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3536548912525177},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33546605706214905},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.32974594831466675},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.2304631471633911},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21985918283462524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09627363085746765},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:115698393","doi":null,"is_oa":false,"landing_page_url":"http://webdoc.sub.gwdg.de/univerlag/2010/mkwi/03_anwendungen/planen_scheduling/05_finding_the_needle_in_the_haystack.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.303.220","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.220","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://webdoc.sub.gwdg.de/univerlag/2010/mkwi/03_anwendungen/planen_scheduling/05_finding_the_needle_in_the_haystack.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W47380661","https://openalex.org/W114498002","https://openalex.org/W1493393458","https://openalex.org/W1504466744","https://openalex.org/W1522056280","https://openalex.org/W1528097685","https://openalex.org/W1588577747","https://openalex.org/W1625390266","https://openalex.org/W2099587183","https://openalex.org/W2137939385","https://openalex.org/W2914215521","https://openalex.org/W3142540905"],"related_works":["https://openalex.org/W3113078550","https://openalex.org/W2577899320","https://openalex.org/W7098723029","https://openalex.org/W7096763692","https://openalex.org/W1989179971","https://openalex.org/W2232435083","https://openalex.org/W1603772156","https://openalex.org/W1904263529","https://openalex.org/W1513276779"],"abstract_inverted_index":{"Abstract.":[0],"In":[1],"this":[2],"paper":[3],"we":[4,27,76,106],"consider":[5],"the":[6,103,119,132,135],"search":[7,56,68,133],"in":[8],"large":[9],"state":[10],"spaces":[11],"with":[12],"high":[13],"branching":[14],"factors":[15],"and":[16,45,66,72,112],"an":[17],"objective":[18],"function":[19],"to":[20,29,69,121,126,134],"be":[21,86,122],"maximized.":[22],"Our":[23],"method":[24],"portfolio,":[25],"which":[26,80],"refer":[28],"as":[30,38,47,59],"heuristically":[31],"guided":[32],"swarm":[33],"tree":[34],"search,":[35],"is":[36,124],"randomized,":[37],"it":[39,48],"consists":[40],"of":[41],"several":[42,90],"Monte-Carlo":[43],"runs,":[44,63],"guided,":[46],"relies":[49],"on":[50,89,93],"fitness":[51],"selection.":[52],"We":[53,96,129],"apply":[54],"different":[55],"enhancement":[57],"such":[58],"UCT,":[60,79],"look-aheads,":[61],"multiple":[62],"symmetry":[64],"detection":[65],"parallel":[67],"increase":[70],"coverage":[71],"solution":[73],"quality.":[74],"Theoretically,":[75],"show":[77],"that":[78],"trades":[81],"exploration":[82],"for":[83],"exploitation,":[84],"can":[85],"more":[87],"successful":[88],"runs":[91],"than":[92],"only":[94],"one.":[95],"look":[97],"at":[98],"two":[99],"case":[100],"studies.":[101],"For":[102,116],"Same":[104],"Game":[105],"devise":[107],"efficient":[108],"node":[109],"evaluation":[110],"functions":[111],"tabu":[113],"color":[114],"lists.":[115],"Morpion":[117],"Solitaire":[118],"graph":[120],"searched":[123],"reduced":[125],"a":[127],"tree.":[128],"also":[130],"adapt":[131],"graphics":[136],"processing":[137],"unit.":[138],"1":[139]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W115698393","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
