{"id":"W2740793701","doi":"10.24963/ijcai.2017/72","title":"Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads","year":2017,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Iterative deepening depth-first search; Beam search; Artificial intelligence; Search problem; State (computer science); Search algorithm; Incremental heuristic search; Machine learning; State space; Time complexity; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193493,0.0001352119,0.0001683162,0.0000621218,0.0007530017,0.0004608547,0.001126472,0.000055701,0.00001854834],"category_scores_gemma":[0.00004036789,0.0001049584,0.0000430665,0.00006589033,0.00006165105,0.0005474779,0.0001871531,0.0001661966,0.00003636539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001937091,"about_ca_system_score_gemma":0.0001687654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003725789,"about_ca_topic_score_gemma":0.00002689029,"domain_scores_codex":[0.9988353,0.0000339797,0.0001438526,0.0003779265,0.0002172855,0.0003917038],"domain_scores_gemma":[0.9985769,0.0001996844,0.00008958806,0.0009089097,0.0001018212,0.0001230823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00116746,0.002016328,0.1561014,0.001204134,0.0008289728,0.0009170448,0.01469999,0.01133887,0.06973626,0.2445069,0.09221009,0.4052726],"study_design_scores_gemma":[0.001967778,0.001005929,0.03657875,0.0003914507,0.00002120219,0.0000673859,0.00004401192,0.9406067,0.01243913,0.001768629,0.004363314,0.0007457475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2250703,0.00003488957,0.7415862,0.004057781,0.0001080288,0.0003791864,0.0000180688,0.0004831049,0.02826241],"genre_scores_gemma":[0.4103805,0.000005730586,0.5800857,0.0003274349,0.0001499612,0.00001313243,0.00003017562,0.00002106956,0.008986347],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9292678,"threshold_uncertainty_score":0.5791556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03405513096010456,"score_gpt":0.2921945866506795,"score_spread":0.258139455690575,"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."}}