{"id":"W1592436817","doi":"10.1609/aaai.v24i1.7555","title":"Single-Frontier Bidirectional Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Frontier; Node (physics); Computer science; Tree (set theory); Shortest path problem; Path (computing); Task (project management); Current (fluid); Search algorithm; Range (aeronautics); Bidirectional search; Mathematical optimization; Algorithm; Theoretical computer science; Incremental heuristic search; Mathematics; Beam search; Engineering; Graph; Computer network; Geography","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.0009112328,0.0001813426,0.0002044219,0.0002387141,0.0002456017,0.000433591,0.002594032,0.0001049026,0.0004870457],"category_scores_gemma":[0.001037099,0.0001368963,0.000104065,0.001076442,0.000409178,0.0004286199,0.0005519737,0.0006533229,0.0002271868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000343132,"about_ca_system_score_gemma":0.0001841672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002957017,"about_ca_topic_score_gemma":0.000008305734,"domain_scores_codex":[0.9975718,0.00002640999,0.0004587995,0.0005144001,0.001034882,0.0003937249],"domain_scores_gemma":[0.9976195,0.000132533,0.0001858588,0.0004120061,0.001500996,0.0001490677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001971038,0.0002069765,0.0001602625,0.00001411971,0.00001144749,4.243093e-7,0.0003221545,0.00006192279,0.121788,0.7572852,0.0004236361,0.1197062],"study_design_scores_gemma":[0.00002359529,0.0001141458,0.0002169288,0.00003303409,0.000004157112,0.000009866648,0.00009254585,0.2769368,0.6676471,0.05394934,0.0007956279,0.0001768629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1607355,0.00002735202,0.6836759,0.02008617,0.005178322,0.001380773,0.0000174296,0.0004422259,0.1284564],"genre_scores_gemma":[0.9369345,0.00001245654,0.06082743,0.0001158952,0.0001410283,0.00002136286,4.542033e-7,0.00001416637,0.001932733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.776199,"threshold_uncertainty_score":0.558247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09925960070521146,"score_gpt":0.3189109092959158,"score_spread":0.2196513085907044,"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."}}