{"id":"W3016390056","doi":"10.1109/lcomm.2020.2987639","title":"Completion-Time-Driven Scheduling for Uplink NOMA-Enabled Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Noma; Telecommunications link; Computer science; Scheduling (production processes); Wireless network; Wireless; Computer network; Distributed computing; Pairing; Computational complexity theory; Mathematical optimization; Algorithm; Mathematics; Telecommunications","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.00315972,0.0008336739,0.001263564,0.0004851965,0.001070854,0.0009638687,0.001105194,0.0005762722,0.001320507],"category_scores_gemma":[0.006600788,0.0004499714,0.0005222544,0.0009765076,0.0009925696,0.001003708,0.0009973805,0.001434243,0.0002560513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001191365,"about_ca_system_score_gemma":0.003350228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002726757,"about_ca_topic_score_gemma":0.00312781,"domain_scores_codex":[0.9982626,0.0007521233,0.00006933965,0.0002777363,0.0003415863,0.0002966867],"domain_scores_gemma":[0.9960248,0.002224947,0.0005310497,0.0003362753,0.0004897717,0.000393085],"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.0002519172,0.00009711979,0.0004357561,0.0001503111,0.00003220631,0.0001519111,0.0001228773,0.9262783,0.005788245,0.04265874,0.001841379,0.02219114],"study_design_scores_gemma":[0.00001017703,0.00004646011,0.00006378787,0.000003169959,0.000003492969,0.00001981699,0.00001427533,0.9932811,0.0005577065,0.005558067,0.0004359405,0.000005970272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03528412,0.0004586473,0.9611507,0.0002603716,0.0001837009,0.0001157973,0.00009074771,0.0001750151,0.002280949],"genre_scores_gemma":[0.9002492,0.000449599,0.09710006,0.0000888244,0.0001548062,0.0001740445,0.0001168019,0.0000571872,0.001609397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00315972,"threshold_uncertainty_score":0.0167104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03607211356565994,"score_gpt":0.2503668193652092,"score_spread":0.2142947057995492,"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."}}