{"id":"W2747118187","doi":"10.1016/j.artint.2017.05.004","title":"MM: A bidirectional search algorithm that is guaranteed to meet in the middle","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Incremental heuristic search; Bidirectional search; Beam search; Heuristic; Best-first search; Search algorithm; Algorithm; Computer science; Disjoint sets; Node (physics); Search problem; Depth-first search; Iterative deepening depth-first search; Null-move heuristic; Mathematics; Artificial intelligence","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.002157907,0.001451331,0.001648605,0.001642547,0.001465977,0.0018738,0.003248823,0.004260763,0.01146518],"category_scores_gemma":[0.008676331,0.0008623649,0.001106669,0.001339299,0.001073977,0.002794371,0.005474955,0.002623571,0.003824871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089354,"about_ca_system_score_gemma":0.002799314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0028835,"about_ca_topic_score_gemma":0.00314956,"domain_scores_codex":[0.9988948,0.0003556185,0.00004557798,0.0002007469,0.0002854983,0.0002177951],"domain_scores_gemma":[0.9983438,0.0007417893,0.0001457002,0.000302843,0.0002727141,0.0001931517],"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.001655749,0.0004756122,0.001475197,0.0004269913,0.0001657394,0.0001722834,0.0002721822,0.2827069,0.007821004,0.1743082,0.03723826,0.4932818],"study_design_scores_gemma":[0.00016135,0.0001975403,0.0001265847,0.00005852588,0.00002930359,0.00007016478,0.00006629271,0.9323184,0.002598746,0.05378828,0.01055304,0.00003169954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02178547,0.0005098265,0.9558762,0.0008917765,0.0003883661,0.0001767474,0.0002331226,0.003178724,0.01695981],"genre_scores_gemma":[0.271335,0.0002889303,0.7064041,0.0006849403,0.000168878,0.0006968899,0.0006949221,0.001237291,0.01848903],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01146518,"threshold_uncertainty_score":0.03835487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2313199868634884,"score_gpt":0.3798248892331862,"score_spread":0.1485049023696978,"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."}}