{"id":"W3037639738","doi":"10.1609/socs.v11i1.18537","title":"A Guide to Budgeted Tree Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Tree (set theory); Heuristic; Mathematical optimization; Search tree; Incremental heuristic search; Exponential function; Exponential growth; Computer science; Search algorithm; Depth-first search; Mathematics; Beam search; Algorithm; Combinatorics","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.001558363,0.001754178,0.001084104,0.002362131,0.000892451,0.002961139,0.002618843,0.002452061,0.05806388],"category_scores_gemma":[0.008774044,0.001623241,0.001024981,0.004554094,0.001311926,0.004127973,0.001567783,0.005022625,0.03950607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002135616,"about_ca_system_score_gemma":0.002958543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007905586,"about_ca_topic_score_gemma":0.01297074,"domain_scores_codex":[0.9987059,0.0003525355,0.0001333439,0.0002052779,0.0005164087,0.00008655021],"domain_scores_gemma":[0.9974135,0.001527208,0.00007873516,0.0002332832,0.0006563457,0.00009104097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004874197,0.0001057462,0.0002555872,0.0007103594,0.00003581464,0.0002086351,0.0001762889,0.018584,0.0009620663,0.2237965,0.4240184,0.3310979],"study_design_scores_gemma":[0.00003469193,0.00002589983,0.0001321837,0.0003939335,0.000008573426,0.0002430741,0.00004693522,0.01900895,0.0004181999,0.1870242,0.7926204,0.00004293112],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000540246,0.0272306,0.8306168,0.00645619,0.001206356,0.0003420918,0.003979674,0.005633456,0.1239946],"genre_scores_gemma":[0.008257482,0.0225857,0.889015,0.003596113,0.0006926233,0.0007251991,0.004581114,0.002873034,0.06767373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05806388,"threshold_uncertainty_score":0.194243,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01305475237093703,"score_gpt":0.2718941346757287,"score_spread":0.2588393823047917,"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."}}