{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031537,0.00025161,0.0002431314,0.0001499887,0.0004660454,0.0004250654,0.002228486,0.0001232578,0.00006700265],"category_scores_gemma":[0.0001587037,0.0001760292,0.00007973855,0.0007197203,0.0003928819,0.0005120936,0.0003710396,0.0007754737,0.00007402543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000285622,"about_ca_system_score_gemma":0.0002375321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001648446,"about_ca_topic_score_gemma":0.00003626449,"domain_scores_codex":[0.9979407,0.00001391499,0.0003885871,0.0005418861,0.0006187104,0.0004962638],"domain_scores_gemma":[0.9983737,0.0001261361,0.0002449821,0.0004010084,0.0007126243,0.0001415368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000121048,0.0002115154,0.003290585,0.00008135983,0.00002640483,0.000003418515,0.003167018,0.00350623,0.1128032,0.8484004,0.00007048249,0.02831831],"study_design_scores_gemma":[0.00003990409,0.0003986635,0.0001055157,0.0004054165,0.00001692832,0.00003764773,0.0004010749,0.4184826,0.5672919,0.01233633,0.0001430118,0.0003409865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8413501,0.00001542352,0.1457961,0.003043153,0.0004670061,0.000400762,0.000004442825,0.0001367989,0.008786194],"genre_scores_gemma":[0.9399546,0.0000045858,0.05966195,0.00009364251,0.00008723216,0.000009314416,2.802404e-7,0.00001600989,0.0001724326],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8360641,"threshold_uncertainty_score":0.7178262,"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."}}