{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001881468,0.0001286999,0.0001490302,0.00004512521,0.0001618115,0.0002882677,0.0004856394,0.00004658048,0.00006657096],"category_scores_gemma":[0.0001330771,0.0001138926,0.00007312671,0.0003811962,0.00008279179,0.0004504246,0.0001444851,0.00007803256,0.00001562037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002248169,"about_ca_system_score_gemma":0.00007754166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001008421,"about_ca_topic_score_gemma":0.0000259149,"domain_scores_codex":[0.9988219,0.00005271034,0.0002437654,0.0004014275,0.0001750922,0.0003051559],"domain_scores_gemma":[0.9992942,0.0000596787,0.00006984741,0.0002071641,0.0001611109,0.0002080552],"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.00005838689,0.000316492,0.0001702547,0.0003561489,0.00005739494,0.00000682747,0.00347158,0.7559432,0.0007756899,0.1496608,0.00037402,0.08880915],"study_design_scores_gemma":[0.000882507,0.000113442,0.00001954366,0.000008429417,0.000002658361,0.000001252795,0.00006046542,0.9978984,0.0001276677,0.0001690841,0.0005574333,0.0001590961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004377572,0.000007072165,0.9904755,0.007467109,0.00007603954,0.0009666467,0.000009919941,0.0005063791,0.0004475067],"genre_scores_gemma":[0.08588389,0.000004358719,0.9127601,0.0009851863,0.00001687977,0.00007777786,0.00004367984,0.00001195503,0.0002161879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2419552,"threshold_uncertainty_score":0.4644406,"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."}}