{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006671128,0.0001925902,0.0002247032,0.0001947247,0.001519156,0.001779217,0.002001544,0.00006119496,0.001637302],"category_scores_gemma":[0.00056029,0.0001511889,0.00005194789,0.0002597725,0.0002482284,0.0006302467,0.0009149043,0.000287096,0.002065481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006962178,"about_ca_system_score_gemma":0.0004975469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000646721,"about_ca_topic_score_gemma":0.0000672354,"domain_scores_codex":[0.9971702,0.000117937,0.0002619541,0.0006979664,0.001172713,0.0005792616],"domain_scores_gemma":[0.9969473,0.0002043927,0.00007665821,0.001758086,0.0004936322,0.0005199097],"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.0004145094,0.001713542,0.02103493,0.0001267481,0.0005223106,0.00113764,0.004176649,0.5709071,0.001174852,0.04570308,0.1087303,0.2443583],"study_design_scores_gemma":[0.0005610024,0.000178369,0.03317167,0.00002196553,0.000006416125,0.00006017149,0.00002800507,0.9564435,0.0006206767,0.000073311,0.00852769,0.0003072285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005745936,0.00001311931,0.9646512,0.004336634,0.0003125102,0.0003046102,0.00001039416,0.0001995456,0.02442608],"genre_scores_gemma":[0.1344557,0.000008359763,0.843845,0.0002770683,0.0001099659,0.00004647907,0.000004783547,0.00002385084,0.0212288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3855364,"threshold_uncertainty_score":0.9997807,"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."}}