{"id":"W3044192623","doi":"10.1109/iccworkshops49005.2020.9145440","title":"A Low-Complexity Approach for Sum-Rate Maximization in Cooperative NOMA Enhanced Cellular Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Computer science; Maximization; Base station; Quality of service; Mathematical optimization; Heuristic; Power control; Noma; Computational complexity theory; Optimization problem; Computer network; Power (physics); Algorithm; 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.002102337,0.001581163,0.001300502,0.0006848808,0.0007950027,0.001850043,0.001303857,0.001342936,0.002349568],"category_scores_gemma":[0.005609031,0.0006914433,0.0007786055,0.001045613,0.001611371,0.001594687,0.001362193,0.002008457,0.0005744318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001699273,"about_ca_system_score_gemma":0.001669695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002804351,"about_ca_topic_score_gemma":0.00310087,"domain_scores_codex":[0.9983829,0.0008079288,0.00003783555,0.000176084,0.0004464463,0.0001488043],"domain_scores_gemma":[0.9976439,0.001939673,0.0001030253,0.00009535456,0.0001806074,0.00003738489],"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.00004163925,0.00006715504,0.0001336625,0.000133486,0.00002833091,0.00007987294,0.0000812056,0.9416865,0.002038213,0.03696762,0.001066274,0.01767614],"study_design_scores_gemma":[0.000005885602,0.00001953205,0.00002429987,0.000005284496,0.000003772739,0.00001303869,0.000009193526,0.9934258,0.0003179107,0.005841151,0.0003301102,0.000004113274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004842004,0.000413045,0.9906528,0.0001890637,0.00003135097,0.00005376124,0.00002900464,0.00008783361,0.003700999],"genre_scores_gemma":[0.6970362,0.001276093,0.2949511,0.0002788108,0.0002317965,0.0005721495,0.0001110322,0.0001547779,0.005387911],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002804351,"threshold_uncertainty_score":0.0123291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03382682001200209,"score_gpt":0.2288958206883739,"score_spread":0.1950690006763718,"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."}}