{"id":"W3022014377","doi":"10.1109/twc.2020.2990176","title":"Optimizing Downlink Resource Allocation in Multiuser MIMO Networks via Fractional Programming and the Hungarian Algorithm","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Telecommunications link; Fractional programming; Scheduling (production processes); MIMO; Greedy algorithm; Quadratic programming; Cellular network; Schedule","routes":{"ca_aff":true,"ca_fund":true,"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.001284604,0.0007381766,0.001197624,0.0004047542,0.000441984,0.001162899,0.0006379788,0.0008011612,0.001126162],"category_scores_gemma":[0.001936462,0.0004846892,0.0004687908,0.0007438946,0.0009135759,0.0007981765,0.0006866399,0.0007063143,0.0001665853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215011,"about_ca_system_score_gemma":0.001347208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004872723,"about_ca_topic_score_gemma":0.003400864,"domain_scores_codex":[0.9994565,0.0002577412,0.00001513109,0.00006109467,0.0001107311,0.00009889038],"domain_scores_gemma":[0.9992536,0.0005557849,0.00006553139,0.00002900742,0.00006593736,0.00003004856],"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.00001717367,0.00001193942,0.00006370043,0.00001136882,0.000008838266,0.00001514272,0.000008379761,0.9912112,0.0003002378,0.003628818,0.0001738198,0.004549344],"study_design_scores_gemma":[0.000002443867,0.00000439224,0.00001171708,8.457649e-7,0.000001330437,0.000002275114,0.000002296716,0.998448,0.00009252494,0.001381557,0.00005159822,0.000001097277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0178742,0.0002609143,0.9790551,0.0001405593,0.00002062812,0.00002357939,0.00002801446,0.0001295661,0.002467416],"genre_scores_gemma":[0.823123,0.0004135921,0.1732142,0.0001702732,0.0000344466,0.0001234299,0.00005154972,0.00006502961,0.002804453],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004872723,"threshold_uncertainty_score":0.009688675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01575091970804317,"score_gpt":0.2350068746636033,"score_spread":0.2192559549555601,"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."}}