{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082669,0.0001194141,0.000158057,0.00006700904,0.0001957601,0.0001517317,0.0009239339,0.00005234341,0.000003917172],"category_scores_gemma":[0.00063642,0.00007811969,0.00004981663,0.000268273,0.00008186165,0.0001741174,0.0002572626,0.0003217846,0.000001446968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001734068,"about_ca_system_score_gemma":0.00008143119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002794695,"about_ca_topic_score_gemma":7.832699e-8,"domain_scores_codex":[0.998839,0.00004951944,0.0002489625,0.0002559436,0.0004623288,0.0001442353],"domain_scores_gemma":[0.9986878,0.0006086751,0.000213162,0.00006774766,0.0003704865,0.00005213844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006595557,0.00009877422,0.4199786,0.000953169,0.000392036,0.000005464862,0.009796338,0.06950846,0.2322269,0.2641068,0.0002935808,0.001980304],"study_design_scores_gemma":[0.0002061374,0.00009092836,0.01821107,0.001062978,0.000009331448,0.00001437132,0.000291371,0.944216,0.0347881,0.001013439,0.00001067721,0.00008561525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9894788,0.00008384689,0.003773042,0.002496671,0.0002299155,0.0001332424,0.00000898363,0.0002374356,0.003558102],"genre_scores_gemma":[0.9967505,0.000004787408,0.003062712,0.0001086996,0.00004677306,0.000006133468,0.000001812071,0.000006545753,0.00001198816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8747075,"threshold_uncertainty_score":0.3185628,"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."}}