{"id":"W2117584696","doi":"10.11575/prism/30625","title":"Fair and Efficient Scheduling in Wireless Networks with Successive Interference Cancellation","year":2010,"lang":"en","type":"article","venue":"Open MIND","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":10,"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.003765051,0.0008826543,0.001052888,0.0008052733,0.001225338,0.001303576,0.001385444,0.0008850072,0.001086467],"category_scores_gemma":[0.007956106,0.000472812,0.0004958386,0.001407957,0.001947993,0.001750272,0.001050866,0.0007710253,0.0002318818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001831934,"about_ca_system_score_gemma":0.002976777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005413777,"about_ca_topic_score_gemma":0.004721951,"domain_scores_codex":[0.9972187,0.001200288,0.00008679458,0.0002701691,0.0008139049,0.0004100128],"domain_scores_gemma":[0.9975986,0.001586558,0.000227741,0.0002562952,0.00023816,0.00009260567],"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.00009199587,0.00003584932,0.0001382218,0.00004219661,0.00001813222,0.00005501409,0.00006427261,0.9151828,0.001741826,0.06314423,0.0007224083,0.01876297],"study_design_scores_gemma":[0.00002865447,0.00002703434,0.00004745398,0.000003756338,0.000006059245,0.00002070886,0.00001260776,0.9644077,0.0006271834,0.03401898,0.0007937767,0.000006141882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02327421,0.0004882839,0.9722514,0.0001752091,0.00007851664,0.00009022107,0.00003940587,0.0002013044,0.003401487],"genre_scores_gemma":[0.7783434,0.0006991345,0.2174252,0.0001083601,0.0001449891,0.000225194,0.00006744922,0.00006812478,0.002918145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005413777,"threshold_uncertainty_score":0.01991171,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007689169303635924,"score_gpt":0.2336451485173617,"score_spread":0.2259559792137257,"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."}}