{"id":"W4391233586","doi":"10.2139/ssrn.4706325","title":"Approximate Linear Programming for a Queueing Control Problem","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Queueing theory; Linear programming; Computer science; Layered queueing network; Control (management); Mathematical optimization; Queueing system; Mathematics; Computer network; Artificial intelligence","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":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004617305,0.000384207,0.0004458136,0.0003633021,0.0003263593,0.001301923,0.001600475,0.0002737796,0.00000382749],"category_scores_gemma":[0.00007848431,0.0003320849,0.0004078384,0.0003170562,0.00004265465,0.0002553154,0.0008577405,0.005755045,0.00002570051],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009737739,"about_ca_system_score_gemma":0.007071162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000265342,"about_ca_topic_score_gemma":0.00008144839,"domain_scores_codex":[0.9945971,0.0001601426,0.0006556425,0.0007413288,0.0004995856,0.003346228],"domain_scores_gemma":[0.9985009,0.00008855189,0.0003598715,0.0004718725,0.0003905847,0.0001881556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003071822,0.00009242752,0.00001328179,0.0004533014,0.0004875791,0.00001018496,0.0006364126,0.02095027,0.00004077058,0.8203914,0.0001662076,0.1567275],"study_design_scores_gemma":[0.0005933043,0.0002214597,2.871737e-7,0.0002061339,0.00003865406,0.0001539997,0.00006733468,0.4585544,0.00001522906,0.5357982,0.004085332,0.0002656839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001203464,0.004586663,0.9869626,0.0050663,0.000653539,0.001744522,0.000007372702,0.0004072398,0.0004514855],"genre_scores_gemma":[0.2453366,0.005041665,0.7379149,0.0005724839,0.002265678,0.001431505,0.00004671069,0.0002628464,0.007127573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4376041,"threshold_uncertainty_score":0.9999131,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01458331953477408,"score_gpt":0.2810955688250589,"score_spread":0.2665122492902848,"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."}}