{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215932,0.0001478968,0.0001577214,0.0001858659,0.0006193339,0.0003174534,0.002487964,0.00004786029,0.000006285597],"category_scores_gemma":[0.000118838,0.0001368124,0.00006948416,0.000718431,0.00004372036,0.0002391171,0.002483794,0.0003629012,0.000007641223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000289482,"about_ca_system_score_gemma":0.00007308638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001563623,"about_ca_topic_score_gemma":0.000001283878,"domain_scores_codex":[0.9975039,0.00002927333,0.0002997163,0.0004992973,0.001397172,0.0002706634],"domain_scores_gemma":[0.9987585,0.0001051516,0.0001162069,0.0001871057,0.0007190653,0.0001139917],"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.0002398845,0.001259433,0.00292806,0.0001033028,0.0001048406,0.000001197618,0.003678873,0.04456941,0.046671,0.8939142,0.0004704118,0.006059437],"study_design_scores_gemma":[0.001567069,0.001823889,0.0004879273,0.0002910841,0.00001966632,0.00005490303,0.0004079784,0.5997191,0.3716436,0.01626007,0.007034997,0.0006897282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9648561,0.00003818819,0.008770013,0.01772647,0.0017706,0.001654313,0.000006721486,0.0003184496,0.004859088],"genre_scores_gemma":[0.9948918,0.00001176442,0.004234396,0.0001784613,0.0001622612,0.0002406309,0.000002220358,0.00001700254,0.0002614503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8776541,"threshold_uncertainty_score":0.5579048,"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."}}