{"id":"W2075829594","doi":"10.1109/tmc.2013.56","title":"Uplink Scheduling in Wireless Networks with Successive Interference Cancellation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Telecommunications link; Scheduling (production processes); Single antenna interference cancellation; Computational complexity theory; Wireless; Distributed computing; Computer network; Job shop scheduling; Fair-share scheduling; Wireless network; Mathematical optimization; Algorithm; Quality of service; Channel (broadcasting); Telecommunications; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002324031,0.0009917454,0.001573435,0.0006038204,0.001184696,0.001605746,0.001267786,0.0009669736,0.001644204],"category_scores_gemma":[0.005680898,0.0005667703,0.0006097758,0.001941738,0.001434787,0.001925686,0.001104739,0.001232824,0.0003426642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039417,"about_ca_system_score_gemma":0.002521038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006676342,"about_ca_topic_score_gemma":0.005451071,"domain_scores_codex":[0.997971,0.0009403225,0.00007325162,0.0002234815,0.0004374935,0.0003544928],"domain_scores_gemma":[0.9957795,0.003309764,0.0003549418,0.0002087015,0.0002564843,0.00009058083],"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.0001186914,0.00006447294,0.0002354225,0.0001462521,0.0000277186,0.0001003365,0.00008236052,0.9265336,0.001311248,0.04335792,0.001976268,0.02604576],"study_design_scores_gemma":[0.00003166837,0.00003402241,0.0000694624,0.000007192382,0.0000097917,0.0000339857,0.00003335532,0.9754826,0.0005937534,0.02275734,0.000938852,0.000008001499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03336369,0.001778747,0.9568248,0.0006600245,0.0001474357,0.000133737,0.00009377088,0.0002444764,0.006753194],"genre_scores_gemma":[0.7299465,0.002975837,0.2612402,0.0003297101,0.000428646,0.0002690055,0.000202506,0.0001088045,0.004498858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006676342,"threshold_uncertainty_score":0.01479709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01743833570027899,"score_gpt":0.255682653234459,"score_spread":0.23824431753418,"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."}}