{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962274,0.0001249194,0.0002470431,0.00009480684,0.00002243358,0.00002577272,0.0002287474,0.00009846267,0.00001036615],"category_scores_gemma":[0.00008482098,0.00009906148,0.00005558403,0.0003968529,0.00004457048,0.0001282937,0.000006514299,0.0001600305,0.000001600374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001396874,"about_ca_system_score_gemma":0.000009479973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000669885,"about_ca_topic_score_gemma":0.000001509092,"domain_scores_codex":[0.9992021,0.000006254113,0.00031349,0.000111633,0.0001744664,0.0001920713],"domain_scores_gemma":[0.9996331,0.00004477772,0.00007918051,0.00008653627,0.0001272916,0.00002914343],"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.0001574039,0.0004049547,0.120195,0.0004632845,0.0001871438,0.000005032529,0.008842121,0.7443051,0.006709989,0.029296,0.0007149988,0.08871894],"study_design_scores_gemma":[0.0007729172,0.00006527956,0.02492784,0.00009070518,0.0000219931,0.00000298847,0.00128545,0.9690609,0.002792126,0.0007885305,0.00003929523,0.0001519511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8991321,0.001467721,0.09638129,0.0003404594,0.0001577682,0.0003051773,0.000005024355,0.0001847664,0.002025671],"genre_scores_gemma":[0.9908838,0.00006581595,0.0088809,0.0000637195,0.00006955836,0.000009981932,0.000002246355,0.00001320014,0.00001073634],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2247558,"threshold_uncertainty_score":0.403961,"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."}}