{"id":"W2043153978","doi":"10.1049/iet-com.2013.0558","title":"Uplink scheduling solution for enhancing throughput and fairness in relayed long‐term evolution networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Maximum throughput scheduling; Term (time); Scheduling (production processes); Throughput; Computer network; Fairness measure; Telecommunications; Dynamic priority scheduling; Mathematical optimization; Round-robin scheduling; Wireless; Quality of service; 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.001147053,0.0001470104,0.0001953058,0.000130546,0.00078112,0.0001740271,0.001604867,0.0001067496,0.000001908881],"category_scores_gemma":[0.0002085056,0.0001624017,0.00005319667,0.00053422,0.0001218464,0.0005968545,0.001116537,0.0003463766,0.000005227492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001411149,"about_ca_system_score_gemma":0.00005477388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002440254,"about_ca_topic_score_gemma":0.002277051,"domain_scores_codex":[0.998553,0.000362137,0.0004072984,0.0003102114,0.00008195908,0.000285381],"domain_scores_gemma":[0.996732,0.0007011013,0.0001317219,0.002171774,0.000193765,0.00006967021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001650293,0.0002077161,0.007784035,0.00003320862,0.0000301652,1.826727e-7,0.002280128,0.009336953,0.002575734,0.7518506,0.0001232247,0.2257616],"study_design_scores_gemma":[0.0004976892,0.00003705528,0.02065863,0.0001389954,0.000007760949,0.00000476631,0.00002245464,0.9745748,0.00005125959,0.003318446,0.0004985909,0.0001895664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007415139,0.003203512,0.984142,0.004058619,0.000149477,0.0003920762,6.414459e-7,0.0001512796,0.0004872419],"genre_scores_gemma":[0.8834677,0.00167229,0.1144106,0.0001709779,0.00004996841,0.0001538876,0.00002839303,0.0000123393,0.00003385107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9652379,"threshold_uncertainty_score":0.662255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04230175406491025,"score_gpt":0.3090671617321022,"score_spread":0.2667654076671919,"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."}}