{"id":"W2604948093","doi":"10.24963/ijcai.2017/69","title":"Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Heuristics; Consistent heuristic; Heuristic; Bidirectional search; Incremental heuristic search; Mathematical optimization; Search algorithm; Beam search; Best-first search; Mathematics; Node (physics); Null-move heuristic; Computer science; Algorithm; Combinatorics; Engineering","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.001164356,0.0008600246,0.0009873031,0.0006030544,0.0006496282,0.0007599667,0.001178243,0.001110523,0.003171985],"category_scores_gemma":[0.003387986,0.0004577538,0.0006646193,0.0006434976,0.000505739,0.000928813,0.00147064,0.001000614,0.0006694583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005381328,"about_ca_system_score_gemma":0.00142073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002426811,"about_ca_topic_score_gemma":0.003986081,"domain_scores_codex":[0.999358,0.0002221723,0.00003767106,0.00009391249,0.0001608807,0.0001274047],"domain_scores_gemma":[0.998762,0.0006501457,0.0001153319,0.000221957,0.0001828541,0.00006767906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004172143,0.0003429918,0.001523094,0.0001524154,0.00005515188,0.0001590132,0.0001731953,0.73725,0.007327669,0.02327337,0.002527563,0.2267983],"study_design_scores_gemma":[0.0000290126,0.00007075539,0.00008704166,0.0000113177,0.00001078379,0.00002992165,0.00003673732,0.9897903,0.001580247,0.0073652,0.0009837983,0.000004987418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1037293,0.0002775704,0.8829263,0.0001452496,0.00004337011,0.0001898825,0.000117599,0.0009566873,0.01161399],"genre_scores_gemma":[0.4679986,0.0001096152,0.5277045,0.0001455834,0.0000151383,0.0002795225,0.0003482519,0.0001590956,0.00323963],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003171985,"threshold_uncertainty_score":0.01061136,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03792417353133272,"score_gpt":0.316257904040906,"score_spread":0.2783337305095733,"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."}}