{"id":"W3173855118","doi":"10.1609/icaps.v31i1.15978","title":"Iterative-deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Heuristics; Iterative deepening depth-first search; Heuristic; Incremental heuristic search; Beam search; Bidirectional search; Search algorithm; Node (physics); Exploit; Algorithm; 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.001347136,0.0009086368,0.001165252,0.0008317129,0.000454165,0.00102688,0.002052001,0.001165298,0.003094702],"category_scores_gemma":[0.004657945,0.0006637711,0.0008181409,0.0009407909,0.0006978236,0.001490327,0.002235518,0.001180753,0.0006196139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007112656,"about_ca_system_score_gemma":0.002192613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005499488,"about_ca_topic_score_gemma":0.005834532,"domain_scores_codex":[0.9992728,0.0002375053,0.00004775888,0.0001075014,0.0001899129,0.0001445847],"domain_scores_gemma":[0.9981893,0.0009361344,0.000164621,0.0003257062,0.0002970378,0.00008730422],"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.0003092862,0.0001939419,0.001462665,0.0001980878,0.00007136998,0.00008572847,0.0002218,0.7211865,0.005867355,0.02252102,0.001894991,0.2459873],"study_design_scores_gemma":[0.00003828585,0.00006478089,0.0000748796,0.00001298339,0.0000130839,0.00002078269,0.0000239184,0.9906682,0.001478896,0.006581652,0.001014947,0.000007734953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03952514,0.0003331674,0.9542213,0.0001046205,0.00003658355,0.0001023294,0.0000730142,0.001155664,0.004448116],"genre_scores_gemma":[0.4548417,0.0001808198,0.5401877,0.0001752399,0.00002362073,0.0003499197,0.0002691636,0.000244485,0.003727285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005499488,"threshold_uncertainty_score":0.01093495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04752449624311907,"score_gpt":0.308609240293454,"score_spread":0.2610847440503349,"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."}}