{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001969874,0.000190505,0.0001998187,0.0001819634,0.0003412399,0.0002503163,0.0006690494,0.0000684309,0.00003973971],"category_scores_gemma":[0.000002695276,0.0001759622,0.00004281933,0.0008533358,0.00005280002,0.000491363,0.00001511993,0.0005377693,0.00002910843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000131701,"about_ca_system_score_gemma":0.00006226193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008361191,"about_ca_topic_score_gemma":0.0002743338,"domain_scores_codex":[0.9986578,0.0001401047,0.0003312034,0.0004125633,0.0001388441,0.0003195247],"domain_scores_gemma":[0.9987845,0.0003264933,0.0001060891,0.0005137093,0.0001862735,0.00008289921],"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.000004172713,0.00004604317,0.0001393011,0.000003946245,0.000007037668,0.000001366356,0.000434417,0.7422704,0.0002796396,0.0002401693,0.00000394402,0.2565696],"study_design_scores_gemma":[0.0003436075,0.0001016475,0.0004218319,0.0002693867,0.000002827257,0.000005777379,0.00007726939,0.9967272,0.001809999,0.00001843208,0.000009569947,0.0002124357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1930356,0.00008947726,0.8057873,0.0001439507,0.0002548374,0.0003689119,1.78326e-7,0.000144086,0.0001756397],"genre_scores_gemma":[0.9851868,0.0001310846,0.01432014,0.0001604945,0.00003769747,0.0001023891,0.000001147504,0.00001464924,0.00004561067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7921512,"threshold_uncertainty_score":0.7175532,"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."}}