{"id":"W3197111254","doi":"10.1609/socs.v12i1.18581","title":"Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Incremental heuristic search; Null-move heuristic; Iterative deepening depth-first search; Search algorithm; Algorithm; Beam search; Mathematical optimization; Mathematics; Artificial intelligence","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.001050684,0.0007468053,0.00117442,0.0008198996,0.0004818874,0.0009779274,0.002067365,0.001095017,0.00535127],"category_scores_gemma":[0.003802373,0.0005783513,0.0007207704,0.0009823776,0.0006298064,0.001235121,0.002153329,0.001147813,0.0009493532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007035375,"about_ca_system_score_gemma":0.002107108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004237058,"about_ca_topic_score_gemma":0.00511541,"domain_scores_codex":[0.999446,0.0001813432,0.00002824007,0.00006348055,0.000160538,0.0001204763],"domain_scores_gemma":[0.9990182,0.0005163478,0.00007725734,0.0001692455,0.0001684288,0.00005051824],"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.0004042414,0.0002461566,0.0008525826,0.0002286484,0.00008329957,0.0001052532,0.0001971762,0.5960516,0.006203292,0.0549224,0.002310925,0.3383944],"study_design_scores_gemma":[0.0000466314,0.00007777695,0.00006145931,0.0000183224,0.00001512011,0.00002794008,0.0000252215,0.986452,0.002087859,0.009841318,0.001336663,0.000009660873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02930115,0.0002431856,0.9618761,0.00009147001,0.00004070132,0.0000948717,0.00005577347,0.001002289,0.007294497],"genre_scores_gemma":[0.4015197,0.0001998509,0.5912511,0.0001702628,0.00002973031,0.0004247657,0.0002335061,0.0002821805,0.005888943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00535127,"threshold_uncertainty_score":0.01790178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01798461546135943,"score_gpt":0.2674510381562879,"score_spread":0.2494664226949285,"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."}}