{"id":"W2012814553","doi":"10.1002/ett.2513","title":"Low complexity greedy, genetic and hybrid user scheduling algorithms for multiuser MIMO systems with successive zero‐forcing","year":2012,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Tellabs (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Computer science; Algorithm; Scheduling (production processes); Computational complexity theory; MIMO; Mathematical optimization; Mathematics","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.0008284557,0.0005522794,0.0004592495,0.0004125953,0.0003133866,0.0005322787,0.0005576977,0.0007292344,0.0006527705],"category_scores_gemma":[0.002113155,0.0002149564,0.0003026339,0.0004913173,0.0006604456,0.0004101199,0.0004561404,0.0003665581,0.0001262301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007781327,"about_ca_system_score_gemma":0.00109274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003031143,"about_ca_topic_score_gemma":0.003621054,"domain_scores_codex":[0.9996732,0.0001473599,0.00001054936,0.00003150585,0.00009343294,0.000043866],"domain_scores_gemma":[0.99906,0.0006753365,0.0001042546,0.00004653127,0.00008251055,0.00003147314],"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.00003857444,0.00002396652,0.000247068,0.00001537428,0.00001872502,0.00001999892,0.00002363482,0.9774319,0.001043729,0.005097094,0.0001898715,0.01585002],"study_design_scores_gemma":[0.00001568112,0.000026215,0.0000783373,0.000002188498,0.000004052114,0.00001060951,0.00000594925,0.9971586,0.0003940902,0.00216989,0.0001308915,0.00000353316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1163791,0.0004232107,0.8783355,0.0002532711,0.00004722744,0.00005176226,0.00002248316,0.0002205441,0.00426697],"genre_scores_gemma":[0.8196484,0.0001442584,0.1786051,0.0001066924,0.00002444022,0.00007815628,0.00002154679,0.00002114628,0.001350293],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003031143,"threshold_uncertainty_score":0.006026983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02623759317370305,"score_gpt":0.2629609386363705,"score_spread":0.2367233454626675,"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."}}