{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535144,0.0007387988,0.0006638043,0.000352891,0.0003221652,0.0009885894,0.0006283562,0.0006588701,0.002251648],"category_scores_gemma":[0.00184263,0.0003888784,0.0004255378,0.0005392323,0.0007866916,0.0007713491,0.0006796411,0.0009169417,0.0004079766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007724708,"about_ca_system_score_gemma":0.001040438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001674004,"about_ca_topic_score_gemma":0.002463716,"domain_scores_codex":[0.999595,0.0001542951,0.00001016444,0.00005016452,0.0001209582,0.00006951024],"domain_scores_gemma":[0.9995673,0.0003199365,0.0000350661,0.00002276782,0.00004220438,0.00001279282],"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.00006654369,0.00005507173,0.0001763084,0.00009334991,0.00001667061,0.0001213354,0.00008827461,0.887822,0.006426345,0.06436533,0.001285694,0.03948294],"study_design_scores_gemma":[0.000008338067,0.00001541078,0.00003014474,0.000003672714,0.000002539571,0.00001469671,0.000008422478,0.9899138,0.0005457798,0.009069555,0.0003839861,0.000003607067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008535334,0.0001251426,0.9872465,0.0001252824,0.00001778231,0.00002626797,0.0000150664,0.00007026174,0.003838317],"genre_scores_gemma":[0.7146164,0.0004737077,0.276605,0.0001714905,0.00007485044,0.0002628143,0.00005931127,0.0001102331,0.0076261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002251648,"threshold_uncertainty_score":0.007532537,"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."}}