{"id":"W4285601267","doi":"10.24963/ijcai.2022/660","title":"Efficient Budgeted Graph Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Heuristics; Search tree; Mathematical optimization; Graph; Computer science; Search algorithm; Best-first search; Range (aeronautics); Beam search; Tree (set theory); Incremental heuristic search; Limit (mathematics); Local search (optimization); Search problem; Iterative method; Mathematics; Algorithm; Theoretical computer science; 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.001576146,0.001015438,0.0009853082,0.001059079,0.0006978153,0.001393075,0.001978708,0.001111366,0.006331699],"category_scores_gemma":[0.007175866,0.0005348205,0.0007640364,0.0016843,0.0008389949,0.002887119,0.002178493,0.001360809,0.0008746814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414749,"about_ca_system_score_gemma":0.002927915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005783511,"about_ca_topic_score_gemma":0.008397546,"domain_scores_codex":[0.9979626,0.0008096438,0.00009847004,0.0003496831,0.0004827757,0.0002968157],"domain_scores_gemma":[0.9978364,0.001085238,0.0001452505,0.0005330044,0.0002729896,0.0001270765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000287286,0.0001932226,0.001431985,0.0002936897,0.00008963519,0.0001095428,0.0001938548,0.6331864,0.004584115,0.1039618,0.01197105,0.2436974],"study_design_scores_gemma":[0.00004311841,0.00004179422,0.0001446063,0.00002146093,0.0000167386,0.00004411134,0.00004590342,0.934707,0.001425869,0.0594798,0.004019612,0.0000100931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02643619,0.0005155325,0.9597487,0.0004513809,0.00005365997,0.0001625125,0.0002898859,0.001647878,0.01069417],"genre_scores_gemma":[0.3655484,0.0004526556,0.6272655,0.0002467698,0.00003314784,0.0002957679,0.0009949206,0.0004587113,0.004704217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006331699,"threshold_uncertainty_score":0.0211817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05721922264094473,"score_gpt":0.2742359353565563,"score_spread":0.2170167127156115,"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."}}