{"id":"W2084502319","doi":"10.1016/s0377-2217(98)00396-8","title":"Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Computer science; Markov chain; Tree (set theory); Queue; Stationary distribution; Birth–death process; Markov process; Bulk queue; Mathematical optimization; Computer network; Mathematics; Combinatorics; Statistics; Machine learning","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.003836155,0.0001655523,0.0002444457,0.0002790174,0.000621663,0.000687458,0.0003933457,0.0000197191,0.0007132489],"category_scores_gemma":[0.001005132,0.00009201123,0.00004503722,0.0005723065,0.0003844892,0.001251567,0.0001268611,0.0005692135,0.00003936317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002571662,"about_ca_system_score_gemma":0.000131032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002575929,"about_ca_topic_score_gemma":0.00008619158,"domain_scores_codex":[0.9979278,0.0004171837,0.0003503826,0.0002342447,0.0008165209,0.0002538472],"domain_scores_gemma":[0.997924,0.0005092081,0.0001709806,0.0001706385,0.00118525,0.00003998006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.06639948,0.001870333,0.05873244,0.002506776,0.003961503,0.004623915,0.01391745,0.05430822,0.004321379,0.381679,0.01599744,0.3916821],"study_design_scores_gemma":[0.07509007,0.005374286,0.2765942,0.005929526,0.001800978,0.004133282,0.01685965,0.08628,0.00170076,0.1800821,0.3412202,0.004935006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9639569,0.0006035349,0.001700472,0.005765474,0.00003086661,0.0003137828,0.000007151831,0.00001536381,0.02760643],"genre_scores_gemma":[0.9946758,0.0002143237,0.001173656,0.0004978576,0.0009527295,0.000003147513,0.000005557274,0.00003464477,0.002442294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3867471,"threshold_uncertainty_score":0.7809575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02225835286212159,"score_gpt":0.2854121590917731,"score_spread":0.2631538062296516,"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."}}