{"id":"W1986082194","doi":"10.1109/iscc.2008.4625665","title":"A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; MIMO; Beamforming; Scheduling (production processes); Algorithm; Graph coloring; Computational complexity theory; Mathematical optimization; Graph; Theoretical computer science; 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.0003406534,0.000739721,0.0004968626,0.0007349209,0.0005541227,0.0004794101,0.0007193009,0.0005218499,0.002684776],"category_scores_gemma":[0.001026258,0.0002973977,0.0003785579,0.001041216,0.0004426691,0.0006718385,0.0005651833,0.0005462161,0.0006555992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008303342,"about_ca_system_score_gemma":0.001662336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003392881,"about_ca_topic_score_gemma":0.005629141,"domain_scores_codex":[0.9997545,0.00007750999,0.00001057956,0.00003897837,0.00008501847,0.0000333905],"domain_scores_gemma":[0.9996684,0.00016988,0.00003636975,0.00003225939,0.00007213246,0.00002104105],"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.00009543328,0.00008373377,0.0003579455,0.00008432325,0.00003479177,0.00005818706,0.00007943821,0.7662316,0.01200984,0.04408445,0.003729804,0.1731504],"study_design_scores_gemma":[0.00003246404,0.00003954957,0.00007856091,0.000003744405,0.000006293044,0.00002206372,0.000009582926,0.9859821,0.001406898,0.01142269,0.0009875625,0.000008562753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005634663,0.00005173597,0.9923276,0.00009781342,0.00003306593,0.00004489728,0.00003980278,0.0003171063,0.001453386],"genre_scores_gemma":[0.2123183,0.0001903809,0.785004,0.0001212196,0.00003466532,0.0002168364,0.0001987323,0.00007470833,0.001841233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003392881,"threshold_uncertainty_score":0.008981466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01980046468171199,"score_gpt":0.2320450900627989,"score_spread":0.2122446253810869,"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."}}