{"id":"W2079729664","doi":"10.1109/glocom.2012.6503636","title":"Low complexity energy efficient power allocation for green cognitive radio with rate constraints","year":2012,"lang":"en","type":"article","venue":"","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Cognitive radio; Mathematical optimization; Computer science; Efficient energy use; Joule (programming language); Interference (communication); Optimization problem; Computational complexity theory; Base station; Power (physics); Channel (broadcasting); Telecommunications; Wireless; Mathematics; Electrical engineering; Algorithm; Engineering","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.0003545927,0.0001767581,0.0001827344,0.00007145486,0.0001939652,0.00008726175,0.0001749435,0.00004513595,0.00004407109],"category_scores_gemma":[0.00002286957,0.0001399703,0.00006065675,0.0002514283,0.0002389903,0.0002497587,0.00005852987,0.00006965581,0.00001197374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005494944,"about_ca_system_score_gemma":0.00006159627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006128546,"about_ca_topic_score_gemma":0.00008334842,"domain_scores_codex":[0.9987304,0.00008777878,0.0001713868,0.0003299011,0.0001759798,0.000504572],"domain_scores_gemma":[0.9989843,0.0003150778,0.00008897464,0.0001915262,0.0002428746,0.0001772353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001831735,0.0005741257,0.0006910256,0.00002295445,0.0001586741,0.00001444776,0.002078636,0.0003822038,0.001201122,0.8015706,0.0004794266,0.1926436],"study_design_scores_gemma":[0.005433731,0.0009489116,0.03421887,0.0002855215,0.0001002873,0.000337414,0.0006246291,0.9113047,0.03912518,0.003943154,0.002131216,0.00154638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04576019,0.00005436433,0.9460295,0.0004489531,0.0002126207,0.0002658067,0.000006960084,0.0001163605,0.007105214],"genre_scores_gemma":[0.9875814,0.000002585454,0.01133224,0.0007174077,0.0001386365,0.00001415661,0.00001491533,0.0000127025,0.0001859563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9418212,"threshold_uncertainty_score":0.5707824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02090448356029613,"score_gpt":0.2397443578933576,"score_spread":0.2188398743330615,"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."}}