{"id":"W2101755106","doi":"10.1109/wimob.2008.70","title":"Proportional Fairness for MIMO Multi-user Schedulers with Traffic Arrival Process","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Fairness measure; Computer network; Scheduling (production processes); Network packet; Fair queuing; Max-min fairness; MIMO; Network scheduler; Telecommunications link; Maximum throughput scheduling; Transmission delay; Quality of service; Wireless; Real-time computing; Throughput; Processing delay; Round-robin scheduling; Resource allocation; Dynamic priority scheduling; Channel (broadcasting); Mathematical optimization; Telecommunications; 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":[],"consensus_categories":[],"category_scores_codex":[0.00002998546,0.0001597392,0.0001386515,0.00005160831,0.00009940247,0.000009655636,0.00008553159,0.00006426895,0.00003442484],"category_scores_gemma":[0.000009002987,0.0001338997,0.00003096403,0.0001964749,0.0000570358,0.0002710985,0.000004558883,0.00008320132,0.000007100758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004303456,"about_ca_system_score_gemma":0.00004102498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.479717e-7,"about_ca_topic_score_gemma":0.00001188106,"domain_scores_codex":[0.9992337,0.00000381328,0.000169352,0.0001908577,0.0001523575,0.0002499438],"domain_scores_gemma":[0.9996544,0.00001814127,0.00003108014,0.0001103879,0.0001186221,0.00006737794],"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.00003312749,0.0000376758,0.0006017095,0.00006481134,0.00002413545,0.000003244536,0.0001187477,0.9978839,0.0000576812,0.0002786862,0.0001906547,0.0007056916],"study_design_scores_gemma":[0.001165023,0.0000406671,0.000741799,0.00002512433,0.000009979522,0.0000269404,0.0001028796,0.9949892,0.002025334,0.00001306433,0.00058416,0.0002758272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2646416,0.00003193062,0.7341097,0.0000227426,0.00007656186,0.0004237473,0.000003726307,0.0005157408,0.0001741858],"genre_scores_gemma":[0.8222741,0.00001432803,0.1767119,0.00001596777,0.00008185187,0.0002011352,0.00004683021,0.00005940323,0.0005944557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5576324,"threshold_uncertainty_score":0.546027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470483187463864,"score_gpt":0.2285812426273789,"score_spread":0.2138764107527402,"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."}}