{"id":"W3151407988","doi":"10.1109/wcnc.2011.5779164","title":"Fair and efficient scheduling in wireless networks with successive interference cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Maximum throughput scheduling; Proportionally fair; Computer science; Round-robin scheduling; Fair-share scheduling; Scheduling (production processes); Dynamic priority scheduling; Rate-monotonic scheduling; Job shop scheduling; Greedy algorithm; Distributed computing; Computer network; Mathematical optimization; Algorithm; Mathematics; 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.00003936653,0.000113859,0.0001109949,0.00006370901,0.00002450418,0.00001373997,0.00005367792,0.0000517737,0.00002049247],"category_scores_gemma":[0.000002576232,0.0001006148,0.000006102217,0.0002252041,0.00003101372,0.0001148345,0.00001897184,0.0001215879,0.000001155612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005218865,"about_ca_system_score_gemma":0.000006168452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003921747,"about_ca_topic_score_gemma":0.0003860978,"domain_scores_codex":[0.9994693,0.000009552934,0.0001377734,0.0001517609,0.00005217147,0.0001793745],"domain_scores_gemma":[0.9997854,0.00002869086,0.00002815405,0.00008914169,0.00002846566,0.00004013084],"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.00001910416,0.000006271331,0.00630419,0.00001233145,0.000004497766,0.000002945621,0.0003422036,0.988074,0.00004913206,0.0006156025,0.000001293796,0.004568395],"study_design_scores_gemma":[0.0002356759,0.0000193245,0.003039959,0.0001069483,0.000003104312,0.000001629433,0.0001206219,0.995501,0.0008130902,0.00001891924,0.000001110011,0.0001386583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3858416,0.00009495122,0.612186,0.000002130772,0.0000499938,0.0000850177,1.799937e-7,0.00009673375,0.001643384],"genre_scores_gemma":[0.9844851,0.0000995833,0.01532977,0.000007695835,0.00002271551,0.00001565631,0.000003690212,0.00002255373,0.00001325565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5986435,"threshold_uncertainty_score":0.4102952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00819358750271412,"score_gpt":0.180100289393398,"score_spread":0.1719067018906839,"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."}}