{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001501927,0.0007855383,0.001068062,0.001002301,0.0008331466,0.001278893,0.002531107,0.001251179,0.003434216],"category_scores_gemma":[0.007139145,0.0004755197,0.0006157737,0.001066257,0.0009196737,0.002335642,0.001767198,0.001608432,0.0007700187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008169202,"about_ca_system_score_gemma":0.001585576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004278024,"about_ca_topic_score_gemma":0.006416814,"domain_scores_codex":[0.9988049,0.0003360448,0.00009675532,0.0002401246,0.0003642368,0.0001578315],"domain_scores_gemma":[0.9967166,0.001985303,0.0002337282,0.0006969096,0.000241922,0.0001255234],"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.0006022133,0.0003293781,0.001341742,0.0003400446,0.000090394,0.0003153538,0.0004076042,0.4997233,0.01441955,0.03528739,0.005850559,0.4412923],"study_design_scores_gemma":[0.00004385215,0.0000687972,0.0001969144,0.00002211167,0.0000188602,0.00008303166,0.00002388873,0.9768717,0.003606313,0.0163488,0.002704768,0.0000110598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03500778,0.0009623633,0.955506,0.0002101545,0.00007367293,0.00009262193,0.00009843506,0.004212335,0.003836622],"genre_scores_gemma":[0.5413283,0.0004194501,0.4540035,0.0001984563,0.00004049372,0.0002593567,0.0003750307,0.0004073403,0.002968024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004278024,"threshold_uncertainty_score":0.01148856,"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."}}