{"id":"W4313012479","doi":"10.1609/socs.v15i1.21754","title":"A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Beam search; Search algorithm; Beam stack search; Computer science; Bounded function; Best-first search; Iterative deepening depth-first search; Computation; Mathematical optimization; Scheduling (production processes); Algorithm; Theoretical computer science; Mathematics","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.001927382,0.0007676804,0.0008969294,0.001001136,0.000656314,0.0007730846,0.001587805,0.0011392,0.004208314],"category_scores_gemma":[0.006761503,0.0005222159,0.000693816,0.001385577,0.001097246,0.001298266,0.001308857,0.001316301,0.0007217172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003851,"about_ca_system_score_gemma":0.002506634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006240739,"about_ca_topic_score_gemma":0.007903227,"domain_scores_codex":[0.9989526,0.0004071078,0.00005686238,0.000157121,0.0002667618,0.0001595901],"domain_scores_gemma":[0.997981,0.00114905,0.0001255013,0.0003032297,0.0003343603,0.000106899],"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.0005291477,0.0001941498,0.002739131,0.0002141311,0.00008576929,0.0001029456,0.0002605458,0.6925173,0.01095942,0.03994859,0.009297981,0.2431508],"study_design_scores_gemma":[0.00004155994,0.00005653656,0.0001348457,0.00001332179,0.00001056773,0.00002528915,0.00001979006,0.98583,0.002080574,0.01020755,0.001569889,0.00001003375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03467936,0.0003836441,0.9591274,0.0003741419,0.0000613268,0.0001046639,0.000117913,0.001979237,0.00317227],"genre_scores_gemma":[0.1913108,0.0001719962,0.8055767,0.0002691765,0.00002799643,0.0002474318,0.0002434123,0.0004355985,0.001716806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006240739,"threshold_uncertainty_score":0.01407826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0191383338720527,"score_gpt":0.2740060664272984,"score_spread":0.2548677325552456,"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."}}