{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003846826,0.0008757297,0.001092601,0.0008285212,0.001283294,0.001327743,0.00146761,0.0008833383,0.001096779],"category_scores_gemma":[0.007862202,0.0004878287,0.0005199386,0.001426454,0.001873141,0.001737569,0.001055029,0.0007911538,0.0002475209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001879201,"about_ca_system_score_gemma":0.003055827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005660896,"about_ca_topic_score_gemma":0.005204756,"domain_scores_codex":[0.9970877,0.001222373,0.0000965863,0.0002796697,0.0008835521,0.0004301265],"domain_scores_gemma":[0.9974728,0.001638226,0.0002308038,0.0003007712,0.0002591171,0.00009827709],"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.0001046115,0.00004097207,0.0001459924,0.00004693221,0.00001992465,0.00006321776,0.00007188114,0.9078001,0.002082908,0.06632745,0.0008321004,0.02246401],"study_design_scores_gemma":[0.00003068561,0.0000286145,0.0000473697,0.00000396681,0.00000664073,0.00002279606,0.00001301152,0.9634167,0.0007201913,0.03477672,0.0009264057,0.000006833728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02258511,0.0005529734,0.9728621,0.0001710017,0.00008501588,0.00009690986,0.00004060061,0.0002415478,0.003364775],"genre_scores_gemma":[0.7636258,0.0007477954,0.2321126,0.0001118971,0.0001476544,0.0002359515,0.00007356979,0.00007519423,0.002869494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005660896,"threshold_uncertainty_score":0.0203442,"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."}}