{"id":"W2019041940","doi":"10.3182/20090819-3-pl-3002.00038","title":"Fairness of schedules in the control of packet-switched networks","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fairness measure; Network packet; Scheduling (production processes); Computer science; Apportionment; Measure (data warehouse); Max-min fairness; Context (archaeology); Maximum throughput scheduling; Upper and lower bounds; Transformation (genetics); Mathematical optimization; Resource allocation; Computer network; Mathematics; Round-robin scheduling; Dynamic priority scheduling; Quality of service; Throughput; Telecommunications","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.009165399,0.0007986641,0.001678331,0.001074918,0.001440191,0.002744895,0.002389354,0.001158443,0.001772547],"category_scores_gemma":[0.02599568,0.0005727092,0.0004844237,0.001377543,0.00254998,0.002863505,0.001577813,0.001813057,0.0001847904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003025815,"about_ca_system_score_gemma":0.003205551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005397771,"about_ca_topic_score_gemma":0.003226897,"domain_scores_codex":[0.9954376,0.002483142,0.000195461,0.0004691737,0.0009348126,0.0004797953],"domain_scores_gemma":[0.9836107,0.01291156,0.0007157595,0.0008267155,0.001328585,0.0006066629],"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.0008048533,0.000092864,0.0007358337,0.00008473947,0.00004562371,0.00007134594,0.0002728009,0.5880277,0.001752092,0.376577,0.001733998,0.02980109],"study_design_scores_gemma":[0.00004239066,0.00005568242,0.00009247447,0.000007241171,0.00001217582,0.00001047797,0.00002448171,0.874195,0.0004107809,0.1245907,0.0005487106,0.000009884706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06618206,0.001016668,0.9265086,0.0009911474,0.0003802773,0.00007389883,0.00007544005,0.0001460136,0.004625858],"genre_scores_gemma":[0.9432839,0.000571175,0.05234049,0.000125291,0.0003648773,0.000113013,0.00005549934,0.00007265527,0.003073045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009165399,"threshold_uncertainty_score":0.04847181,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006649252761787493,"score_gpt":0.2074179316543177,"score_spread":0.2007686788925302,"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."}}