{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008395351,0.0007482116,0.0009538584,0.0007561565,0.0007213569,0.001172819,0.00138851,0.001095271,0.008919152],"category_scores_gemma":[0.002531376,0.0003994971,0.0006537931,0.0009487352,0.0008302124,0.001897105,0.002002436,0.0009166735,0.001764371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005564611,"about_ca_system_score_gemma":0.001443795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002187643,"about_ca_topic_score_gemma":0.003057305,"domain_scores_codex":[0.9995052,0.0001281643,0.00002145776,0.00009594295,0.0001740746,0.00007525731],"domain_scores_gemma":[0.9993444,0.0002877303,0.00004924899,0.0001362881,0.0001308278,0.00005150064],"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.0004210655,0.0001707078,0.001701909,0.0004773464,0.00009892719,0.0001886979,0.0003162815,0.2750356,0.0122087,0.1880783,0.009847488,0.5114549],"study_design_scores_gemma":[0.00009313229,0.0002006304,0.0002824511,0.00007752767,0.00004192296,0.0002126145,0.0001324891,0.8566113,0.004449682,0.1158918,0.02197375,0.00003277989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02385036,0.0008491463,0.9511526,0.000334828,0.00008946352,0.0001137923,0.0001541976,0.001109141,0.02234636],"genre_scores_gemma":[0.3839393,0.00075529,0.600556,0.0003044225,0.00004348311,0.0003433906,0.0004169642,0.0003614941,0.0132797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008919152,"threshold_uncertainty_score":0.02983755,"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."}}