{"id":"W2128437184","doi":"10.1109/wicom.2009.5304584","title":"A Near Fair User Scheduling Scheme in Cognitive Radio Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Cognitive radio; Computer science; Beamforming; Interference (communication); Scheduling (production processes); Scheme (mathematics); Cognitive network; Selection (genetic algorithm); Computer network; Telecommunications; Mathematical optimization; Wireless; Artificial intelligence; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003191563,0.000210077,0.0002625318,0.0001223684,0.0001613858,0.0003860404,0.0003424844,0.0001043926,0.00003757298],"category_scores_gemma":[0.00005658358,0.0002005431,0.00008818686,0.0009220761,0.00005249025,0.0005900247,0.00009447977,0.0003834211,0.00002793248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006519971,"about_ca_system_score_gemma":0.00006693059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003257025,"about_ca_topic_score_gemma":0.0000650014,"domain_scores_codex":[0.9982897,0.00007245629,0.0002826686,0.0005446458,0.0002112834,0.0005992604],"domain_scores_gemma":[0.9992674,0.0001805242,0.00006219227,0.000266674,0.00008672512,0.00013648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001423768,0.0005929648,0.0185409,0.000008911263,0.000102629,0.001165364,0.002196346,0.04438184,0.0005649122,0.1995222,0.001503527,0.731278],"study_design_scores_gemma":[0.0007804953,0.0001022163,0.01976183,0.0001176969,0.000004189964,0.00004567034,0.00005708139,0.9769096,0.000150854,0.001423328,0.0003366243,0.0003104623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1721018,0.0004176297,0.8147611,0.001095669,0.0001550783,0.0001943911,2.237591e-7,0.0002277647,0.01104637],"genre_scores_gemma":[0.9227735,0.00004496227,0.07497242,0.001827298,0.0001920312,0.000002256349,0.000002206496,0.000009426704,0.0001759106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9325277,"threshold_uncertainty_score":0.817791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01505477029629474,"score_gpt":0.2514315204516498,"score_spread":0.2363767501553551,"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."}}