{"id":"W2397134496","doi":"10.1609/socs.v3i1.18266","title":"Alternative Forms of Bounded Suboptimal Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Bounded function; Construct (python library); Mathematical optimization; Iterative deepening depth-first search; Mathematics; Computer science; Search algorithm; Constant (computer programming); Beam search; Algorithm; Theoretical computer science; Best-first search; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007217868,0.001221377,0.001389118,0.001491476,0.001106645,0.003762635,0.003307323,0.002385539,0.006008987],"category_scores_gemma":[0.03912419,0.0007069827,0.001206993,0.001703766,0.003436952,0.005540784,0.004758719,0.002703702,0.001384319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001988698,"about_ca_system_score_gemma":0.00275998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001312281,"about_ca_topic_score_gemma":0.002084806,"domain_scores_codex":[0.9930313,0.002736832,0.0005506626,0.0009485605,0.002061078,0.0006714999],"domain_scores_gemma":[0.9836028,0.00886191,0.0009936322,0.004284767,0.00170281,0.0005541808],"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.0001143065,0.00004746949,0.0004985094,0.0001370506,0.00003815714,0.00008521324,0.0002613353,0.09521782,0.00171188,0.8609293,0.001736083,0.03922291],"study_design_scores_gemma":[0.00004582631,0.00009513415,0.0001233673,0.00008090611,0.00002568329,0.0001352302,0.00007440856,0.5855912,0.003357124,0.4042389,0.006204556,0.00002773324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01081372,0.000341919,0.9745036,0.0003697579,0.00003979695,0.00006382824,0.00005056091,0.0004279302,0.01338891],"genre_scores_gemma":[0.4186012,0.0005101305,0.5729287,0.0007177909,0.00007241806,0.0004361936,0.0002293523,0.0003005306,0.00620365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007217868,"threshold_uncertainty_score":0.03817219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01429436540194341,"score_gpt":0.2740143347736901,"score_spread":0.2597199693717467,"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."}}