{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008056487,0.0001099211,0.0001246902,0.0000465326,0.00003877024,0.0000939959,0.0001373855,0.00006740144,0.0000614643],"category_scores_gemma":[0.000006392062,0.000103415,0.000005178314,0.0002032491,0.00003689524,0.0001859755,0.00005729299,0.0002495617,0.000004013931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003145268,"about_ca_system_score_gemma":0.00001537544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000019536,"about_ca_topic_score_gemma":0.001486754,"domain_scores_codex":[0.9994386,0.00000945441,0.0001373573,0.0001904339,0.00005571703,0.0001684392],"domain_scores_gemma":[0.9997167,0.00004632752,0.00004025091,0.0001218528,0.00002925194,0.00004561016],"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.00001788519,0.000005954215,0.002303758,0.000004030046,0.000003451912,0.000003389393,0.0002137622,0.9386433,0.0009259396,0.00002682801,0.000001000171,0.05785074],"study_design_scores_gemma":[0.0003387434,0.00001345239,0.001019958,0.0001073936,0.000003638436,0.000002846986,0.00007618708,0.996307,0.001938598,0.000004442492,0.00004528796,0.000142483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.698267,0.00003492325,0.3003215,0.000009713226,0.0001077173,0.0001892852,9.318837e-7,0.000005279575,0.001063684],"genre_scores_gemma":[0.9742592,0.00002292913,0.02560189,0.000003057175,0.0000423364,0.00001677449,0.00001089356,0.00001986665,0.00002302848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2759922,"threshold_uncertainty_score":0.421714,"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."}}