{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003605129,0.0001417527,0.0001703946,0.0002139754,0.0002319877,0.0005637203,0.0007020743,0.00005586856,0.00004486668],"category_scores_gemma":[0.0006505038,0.0001049622,0.00003249364,0.0005981394,0.0000853544,0.0003150939,0.000323809,0.0003531189,0.000004485023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004347436,"about_ca_system_score_gemma":0.0002541415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009678407,"about_ca_topic_score_gemma":3.260374e-7,"domain_scores_codex":[0.9982295,0.00003539764,0.0002649286,0.0003978302,0.0008721062,0.0002002329],"domain_scores_gemma":[0.9978765,0.0001885337,0.0001639166,0.0001201657,0.00156783,0.00008309166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000601334,0.0006367383,0.04454156,0.0004301369,0.001076704,0.00023983,0.008514477,0.1465445,0.2040377,0.5799364,0.001629835,0.0118108],"study_design_scores_gemma":[0.0003649335,0.0000541808,0.004084228,0.0004433913,0.000006624496,0.0001213625,0.0003381049,0.9675822,0.02638721,0.0004705515,0.00002282517,0.0001243371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.902222,0.0001523977,0.05990585,0.005387003,0.000557102,0.0002656155,0.00001589074,0.0006525544,0.03084161],"genre_scores_gemma":[0.9029922,0.00001681045,0.09611549,0.00008939992,0.00004004209,0.000009576762,0.000005547688,0.00001009113,0.0007208776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8210378,"threshold_uncertainty_score":0.5435967,"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."}}