{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003446152,0.0002705609,0.0003305678,0.0002634593,0.0003164255,0.00004157103,0.0001326154,0.0001377297,0.000006778454],"category_scores_gemma":[0.00005235334,0.0002743018,0.0001266674,0.0003125356,0.00003212383,0.0004817397,0.00001734129,0.0001170426,0.000004185559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000181712,"about_ca_system_score_gemma":0.00003898451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003019046,"about_ca_topic_score_gemma":0.00000204162,"domain_scores_codex":[0.9986136,0.00002871211,0.0004734305,0.0002665493,0.0001492697,0.0004684526],"domain_scores_gemma":[0.9992092,0.0002071769,0.00008957908,0.0002727186,0.0001220993,0.00009918233],"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.000005147494,0.000007699659,0.00003334945,0.000182606,0.00003625656,0.000003904255,0.0001327839,0.992227,0.003922597,0.0009662727,0.00001729028,0.002465105],"study_design_scores_gemma":[0.0006672746,0.00002022298,0.000001253654,0.0002035971,0.00002651362,0.00005468817,0.0002728046,0.9925309,0.005484862,0.0002305933,0.0001682112,0.0003391066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006760587,0.0006257386,0.9895828,0.000002066331,0.0008283846,0.0008363515,0.00001456064,0.0008027591,0.0005467882],"genre_scores_gemma":[0.3469725,0.00001233701,0.6524509,0.00001877651,0.0001646762,0.00009388935,0.00002115225,0.0001098928,0.0001558477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3402119,"threshold_uncertainty_score":0.9999709,"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."}}