{"id":"W2566652907","doi":"10.1609/aaai.v30i1.10436","title":"Bidirectional Search That Is Guaranteed to Meet in the Middle","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Compute Canada; National Science Foundation","keywords":"Node (physics); Heuristic; Search algorithm; Bidirectional search; Computer science; Brute force; Best-first search; Midpoint; Incremental heuristic search; Algorithm; Mathematical optimization; Beam search; Mathematics; Artificial intelligence; Engineering; Computer security; Geometry","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.002226542,0.0008448158,0.001257853,0.00127678,0.001404551,0.001684578,0.001718484,0.00201037,0.005329548],"category_scores_gemma":[0.01269165,0.0006970944,0.0009104945,0.001104659,0.0009676629,0.002779061,0.003351855,0.001478927,0.001842803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006693017,"about_ca_system_score_gemma":0.003191096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003735789,"about_ca_topic_score_gemma":0.005230429,"domain_scores_codex":[0.9987802,0.0004026755,0.0000824085,0.0002227869,0.0002979356,0.0002140368],"domain_scores_gemma":[0.9957152,0.00223067,0.0004418992,0.0008244017,0.0004818935,0.0003058542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002408933,0.0007416586,0.005504721,0.0006405315,0.0002182798,0.0004072874,0.0009955809,0.2805244,0.02183906,0.222491,0.01632201,0.4479066],"study_design_scores_gemma":[0.0002247987,0.0004103866,0.0004121685,0.0001331817,0.00007486672,0.0002488805,0.0003478835,0.8580207,0.01410695,0.1134586,0.01251258,0.0000491135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1056507,0.0006205353,0.8621047,0.0009231434,0.0001279135,0.0002184588,0.000298151,0.002781889,0.0272746],"genre_scores_gemma":[0.5088096,0.0002124709,0.4840057,0.0004014455,0.00003950007,0.0002572156,0.0005073489,0.0005802534,0.005186522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005329548,"threshold_uncertainty_score":0.01782912,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1779893460534098,"score_gpt":0.3083391178389802,"score_spread":0.1303497717855704,"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."}}