{"id":"W3037289440","doi":"10.1609/icaps.v30i1.6672","title":"Predicting the Effectiveness of Bidirectional Heuristic Search","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Incremental heuristic search; Beam search; Heuristic; Bidirectional search; Computer science; Best-first search; Set (abstract data type); Search algorithm; Iterative deepening depth-first search; Artificial intelligence; Consistent heuristic; Space (punctuation); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","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.0116439,0.0004920479,0.0007109189,0.001988957,0.0005653622,0.00190693,0.0007899687,0.001326814,0.001968775],"category_scores_gemma":[0.07752342,0.0002925291,0.0003806043,0.001819853,0.0008282381,0.004068654,0.001236128,0.001203591,0.0005174078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009927393,"about_ca_system_score_gemma":0.001194651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00306979,"about_ca_topic_score_gemma":0.00405214,"domain_scores_codex":[0.9959533,0.002172887,0.0003408403,0.0004221656,0.0006926417,0.0004181263],"domain_scores_gemma":[0.9238055,0.06431035,0.003510475,0.003659166,0.003587676,0.001126778],"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.002064473,0.0007194016,0.08426953,0.0005415516,0.0003186733,0.0001425825,0.0003651517,0.6161299,0.004782184,0.02556974,0.002246761,0.26285],"study_design_scores_gemma":[0.00007329182,0.0007967327,0.007682737,0.00008298163,0.00007790401,0.00007855315,0.000343835,0.9589444,0.00279682,0.02785059,0.001244277,0.00002780918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9228208,0.001934306,0.06087211,0.0008344502,0.00006123957,0.000114347,0.000209949,0.0002414899,0.01291134],"genre_scores_gemma":[0.9838389,0.0003095401,0.01519512,0.00006456505,0.00002087347,0.00004124966,0.0001692661,0.00004175942,0.0003186582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0116439,"threshold_uncertainty_score":0.06157959,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04473747509593059,"score_gpt":0.2853317924194003,"score_spread":0.2405943173234697,"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."}}