{"id":"W1527745059","doi":"10.1609/aaai.v24i1.7559","title":"Using Lookaheads with Optimal Best-First Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Heuristics; Exploit; Breadth-first search; Distributed File System; Computer science; Search algorithm; Depth-first search; Algorithm; Search problem; Beam search; Best-first search; Parallel computing; Theoretical computer science; Operating system","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136374,0.001070124,0.0009269808,0.00120771,0.001032739,0.001515348,0.001882865,0.001039179,0.005329437],"category_scores_gemma":[0.005866951,0.0008983253,0.0006479383,0.001481172,0.00102972,0.003351768,0.002503069,0.001250194,0.001132092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000940731,"about_ca_system_score_gemma":0.002319679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005156054,"about_ca_topic_score_gemma":0.005691331,"domain_scores_codex":[0.999086,0.0003017084,0.00007038845,0.0001978628,0.0002340525,0.000109929],"domain_scores_gemma":[0.9981555,0.001041393,0.0001644762,0.0003839165,0.0001659182,0.00008885366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009812712,0.000275995,0.001596577,0.0003495306,0.0001303364,0.0001927346,0.000342452,0.437361,0.008814006,0.07991219,0.007587215,0.4624567],"study_design_scores_gemma":[0.0001125339,0.000154123,0.0001584079,0.00005496183,0.00005858635,0.0001001779,0.00007332484,0.8889832,0.008441039,0.09484697,0.006972048,0.00004470616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02440132,0.0006948743,0.9632505,0.0003416333,0.00007620009,0.0001072067,0.0001603313,0.003424991,0.007542958],"genre_scores_gemma":[0.2793384,0.000267963,0.7171333,0.0001321336,0.00002150692,0.0001353969,0.0003219804,0.0003469877,0.002302305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005329437,"threshold_uncertainty_score":0.0178287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1111729048811701,"score_gpt":0.3144024564566372,"score_spread":0.2032295515754671,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}