{"id":"W3114470063","doi":"10.1109/latincom50620.2020.9282342","title":"A Low-Complexity Multi-Survivor Dynamic Programming for Constrained Discrete Optimization","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"National Instruments Corporation","keywords":"Markov decision process; Dynamic programming; Generalization; Constrained optimization; Optimization problem; Discrete optimization; Markov chain; Stochastic programming; Function (biology)","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.0008214031,0.001039949,0.001071615,0.0004354923,0.000491392,0.0008273192,0.0009923266,0.001209312,0.004447524],"category_scores_gemma":[0.002451522,0.0004820422,0.0006343691,0.0007607123,0.001005714,0.0009932196,0.001525115,0.002157498,0.0004540406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001017273,"about_ca_system_score_gemma":0.001642821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003858361,"about_ca_topic_score_gemma":0.004413018,"domain_scores_codex":[0.999509,0.000172922,0.00001976497,0.0001038809,0.0001397864,0.00005471917],"domain_scores_gemma":[0.999207,0.0005748135,0.00005678283,0.00004229544,0.00007559186,0.00004354608],"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.00003512995,0.00003663825,0.0001516309,0.00007428021,0.00001772594,0.00005916462,0.00003047817,0.9316091,0.0009983183,0.04048921,0.00122559,0.02527267],"study_design_scores_gemma":[0.000006138581,0.0000138455,0.00001572448,0.000003659573,0.000001455373,0.000007095762,0.000003166824,0.990922,0.0001394843,0.008408,0.0004767451,0.000002650679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003412105,0.0001307348,0.993598,0.0001949376,0.00002566859,0.00004180971,0.00004701492,0.0001226814,0.002427125],"genre_scores_gemma":[0.3853769,0.0004490651,0.6062381,0.000268454,0.00007935176,0.0005555491,0.0002650843,0.0001503206,0.006617164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004447524,"threshold_uncertainty_score":0.01487845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0636745229684185,"score_gpt":0.3104675232800502,"score_spread":0.2467930003116317,"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."}}