{"id":"W2140585387","doi":"10.1109/twc.2006.1687732","title":"Analysis of throughput and fairness with downlink scheduling in WCDMA networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maximum throughput scheduling; Rayleigh fading; Computer science; Scheduling (production processes); Telecommunications link; Fading; Throughput; Proportionally fair; Fairness measure; Computer network; Path loss; Code division multiple access; Round-robin scheduling; Wireless; Mathematical optimization; Telecommunications; Mathematics; Channel (broadcasting); Dynamic priority scheduling; Quality of service","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.00009505402,0.0001867884,0.0003523919,0.0004870223,0.0001540877,0.00002352062,0.000293386,0.0001160132,0.000008582861],"category_scores_gemma":[8.689972e-7,0.0001963887,0.00006759015,0.002201608,0.000181289,0.0002265528,0.000003844625,0.0003672902,8.792582e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008181367,"about_ca_system_score_gemma":0.00001428182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000148674,"about_ca_topic_score_gemma":0.004072098,"domain_scores_codex":[0.9990011,0.00006308842,0.0004103622,0.0001906858,0.0001252698,0.0002094983],"domain_scores_gemma":[0.9986255,0.0002605339,0.00007999876,0.0009190133,0.00007578208,0.00003916759],"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.00001423001,0.0001157698,0.001179911,0.0000143258,0.0001844749,5.292254e-7,0.0001192362,0.9893259,0.0001521558,0.0006824044,0.000001317293,0.008209722],"study_design_scores_gemma":[0.0003774457,0.00001848219,0.003361348,0.00008011505,0.0002531818,0.000001484706,0.00009134175,0.9949892,0.0005691872,0.00004344196,0.00001756447,0.0001972517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1539482,0.0004212887,0.8448593,0.00005988642,0.00004088247,0.0001751912,0.00001948163,0.0001587273,0.0003170097],"genre_scores_gemma":[0.9765869,0.00179484,0.0213968,0.00001007957,0.00001028906,0.00009384444,0.0000545422,0.0000394575,0.00001320894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8234625,"threshold_uncertainty_score":0.8008497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009700696747090055,"score_gpt":0.2266546077663861,"score_spread":0.2169539110192961,"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."}}