{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007331109,0.000791802,0.0009435127,0.0005885625,0.001408348,0.001612041,0.001898777,0.0006611219,0.001602445],"category_scores_gemma":[0.01393398,0.0004518112,0.0005165307,0.0007077101,0.001244641,0.00169852,0.000956761,0.0009673177,0.0002914292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002772246,"about_ca_system_score_gemma":0.003414203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005088267,"about_ca_topic_score_gemma":0.004089227,"domain_scores_codex":[0.996347,0.001333457,0.0001619566,0.0004279857,0.001213903,0.0005156759],"domain_scores_gemma":[0.9935869,0.003947815,0.0005140622,0.0006679401,0.00104446,0.0002388118],"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.0008982582,0.0001940507,0.00242307,0.0001360699,0.0001035427,0.0002272177,0.0002912825,0.7704303,0.01096947,0.1456249,0.001868909,0.06683293],"study_design_scores_gemma":[0.00002232457,0.00004875875,0.0001234097,0.000003236954,0.00001282932,0.00003062634,0.00001312418,0.986936,0.001340999,0.01091129,0.000546688,0.00001066515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04114306,0.0004209426,0.9550139,0.0002147345,0.0001865315,0.00009901539,0.0000378996,0.0002823232,0.00260162],"genre_scores_gemma":[0.9112825,0.0002574581,0.08535685,0.0001682524,0.0002246828,0.0001288683,0.00003377081,0.00006179396,0.002485811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007331109,"threshold_uncertainty_score":0.03877103,"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."}}