{"id":"W2118426586","doi":"10.1109/glocom.2009.5426297","title":"A Graph-Based Resource Allocation Algorithm for Downlink MIMO-OFDMA Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Telecommunications link; Orthogonal frequency-division multiple access; MIMO; Resource allocation; Graph coloring; Algorithm; MIMO-OFDM; Frequency-division multiple access; Throughput; Frame (networking); Graph; Mathematical optimization; Computer network; Theoretical computer science; Mathematics; Wireless; 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.0004427698,0.0007198142,0.0006942367,0.0007386337,0.0005771875,0.0006523859,0.0009002897,0.0007053431,0.002400297],"category_scores_gemma":[0.00151034,0.0002750776,0.0003687132,0.0009219764,0.0004761542,0.001172363,0.0006906116,0.0007397038,0.0006295057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008377646,"about_ca_system_score_gemma":0.00105561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003103218,"about_ca_topic_score_gemma":0.004149716,"domain_scores_codex":[0.9996275,0.0001231485,0.00001691104,0.00007433248,0.0001114437,0.00004665033],"domain_scores_gemma":[0.9995079,0.0002709724,0.00003905668,0.00004911355,0.0001083389,0.00002461768],"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.00007123151,0.00008500388,0.0002577246,0.00007883684,0.00003507049,0.00005798696,0.00004745399,0.7671351,0.004315009,0.03614347,0.004815832,0.1869572],"study_design_scores_gemma":[0.0000136328,0.00001443176,0.000043954,0.000003194486,0.000004386653,0.00002279397,0.000006627397,0.9888464,0.0006297038,0.009270438,0.001139032,0.000005430512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003269166,0.0000678508,0.9950063,0.00008793502,0.00002850245,0.00004064583,0.00003104635,0.0002228167,0.001245587],"genre_scores_gemma":[0.1701711,0.0002080509,0.8268273,0.0001267258,0.00004427751,0.0001927025,0.0002023772,0.00009473239,0.002132679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003103218,"threshold_uncertainty_score":0.008029819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005627964591812275,"score_gpt":0.2080356104877419,"score_spread":0.2024076458959297,"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."}}