{"id":"W1955062487","doi":"10.1287/ijoc.2015.0645","title":"Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; University of British Columbia","funders":"","keywords":"Mathematical optimization; Computer science; Workload; Scheduling (production processes); Linear programming; Dynamic programming; Queueing theory; Bellman equation; Dynamic priority scheduling; Schedule; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001293285,0.0001617093,0.0002095029,0.0003674677,0.001860403,0.0001453537,0.00009928496,0.000134403,0.00005356846],"category_scores_gemma":[0.001507997,0.0001113032,0.00004355003,0.0004989571,0.00002795067,0.0003364747,0.00002025432,0.0007197959,0.00011706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005207074,"about_ca_system_score_gemma":0.002172702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009438377,"about_ca_topic_score_gemma":0.00002544459,"domain_scores_codex":[0.9980205,0.0002507298,0.0007889055,0.0001447091,0.0003910226,0.000404183],"domain_scores_gemma":[0.9971204,0.0006521915,0.0004742077,0.0001860907,0.001237341,0.0003297722],"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.0001166712,0.00002848408,0.004483423,0.00002242888,0.00001112116,0.000003871724,0.001229127,0.9878818,0.000002442354,0.002325631,0.0002062664,0.003688715],"study_design_scores_gemma":[0.001866184,0.0003031039,0.0005352448,0.0002231521,0.000009342816,0.000007042818,0.000548405,0.9922865,0.000002345616,0.0001693261,0.003905185,0.0001441464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1281209,0.00001137543,0.8655226,0.002418011,0.0006077506,0.0004059008,0.000005548034,0.000112881,0.002795097],"genre_scores_gemma":[0.9584376,0.000001755701,0.03606021,0.003757802,0.001241232,0.00001130838,0.00008221783,0.00002457156,0.0003832554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8303167,"threshold_uncertainty_score":0.9994391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.164072637517607,"score_gpt":0.4497476770576229,"score_spread":0.2856750395400159,"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."}}