{"id":"W2898297778","doi":"10.1016/j.artint.2018.08.005","title":"Probably bounded suboptimal heuristic search","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Heuristic; Mathematical optimization; Computer science; Incremental heuristic search; Mathematics; Artificial intelligence; Search algorithm; Beam search","routes":{"ca_aff":true,"ca_fund":false,"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.003588956,0.001398724,0.002378774,0.001321656,0.00166784,0.002889393,0.002690763,0.004673757,0.01793933],"category_scores_gemma":[0.03412867,0.001139125,0.001396917,0.001807059,0.002723327,0.003649491,0.002304605,0.003729014,0.002471693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002198024,"about_ca_system_score_gemma":0.002960935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002581221,"about_ca_topic_score_gemma":0.004810542,"domain_scores_codex":[0.9970126,0.001541618,0.0001341312,0.0004441559,0.0005758059,0.0002915119],"domain_scores_gemma":[0.984775,0.0117467,0.0003519364,0.002038358,0.0007593175,0.0003286852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001828526,0.0003324548,0.00177936,0.0008425352,0.0003321559,0.0003749639,0.0003410011,0.3848251,0.001917106,0.3946849,0.06046908,0.1522728],"study_design_scores_gemma":[0.0001972216,0.00009420835,0.0002410363,0.00008479677,0.00006369509,0.0001561342,0.00007045404,0.6569169,0.0006750161,0.3366041,0.004874762,0.00002170306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04649388,0.003474272,0.8675091,0.005830198,0.001011083,0.0002408068,0.0005570734,0.001662826,0.07322071],"genre_scores_gemma":[0.5339674,0.0008049041,0.4356993,0.00219894,0.0003967069,0.0004635029,0.0009969998,0.000696116,0.02477612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01793933,"threshold_uncertainty_score":0.06001306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05176550724848589,"score_gpt":0.323414968421788,"score_spread":0.2716494611733021,"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."}}