{"id":"W2566659572","doi":"10.1609/aaai.v30i1.10081","title":"On the Completeness of Best-First Search Variants That Use Random Exploration","year":2016,"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":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Incremental heuristic search; Greedy algorithm; Computer science; Robustness (evolution); Completeness (order theory); Best-first search; Heuristic; Beam search; Greedy randomized adaptive search procedure; Mathematical optimization; Search algorithm; Graph; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","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.001228895,0.000206311,0.0002665586,0.0001185344,0.0003445598,0.0002602111,0.002017995,0.00007843399,0.00006034654],"category_scores_gemma":[0.0008906586,0.0001033274,0.000104996,0.0004705714,0.0003145694,0.0007790511,0.0002962081,0.0002189396,0.00008786137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003324925,"about_ca_system_score_gemma":0.00009560266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001124524,"about_ca_topic_score_gemma":0.00001308081,"domain_scores_codex":[0.998055,0.00006599096,0.0004639586,0.0004166238,0.0006733852,0.0003250297],"domain_scores_gemma":[0.9969926,0.001435542,0.000397039,0.0004422656,0.0006662587,0.00006623899],"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.0002525058,0.000125485,0.0007868808,0.00003515886,0.00002030877,5.059989e-7,0.002234016,0.000296582,0.02831417,0.9401253,0.0002213724,0.02758771],"study_design_scores_gemma":[0.0001366049,0.0004367017,0.0004017241,0.001599358,0.000015596,0.000003334673,0.0005148058,0.05817842,0.754146,0.184216,0.00008411059,0.0002673847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4868757,0.00002023771,0.482843,0.02539999,0.0006141007,0.0009570786,0.00002536413,0.0001073853,0.003157163],"genre_scores_gemma":[0.9984255,0.00004139603,0.001100917,0.0001669084,0.00003347398,0.00002727224,3.555659e-7,0.00001086074,0.0001933466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7559093,"threshold_uncertainty_score":0.4213571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2383701447523257,"score_gpt":0.3007328333075417,"score_spread":0.06236268855521601,"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."}}