{"id":"W2002491494","doi":"10.1109/icspcs.2011.6140819","title":"Global Optimization Algorithm and sub-optimal algorithms for power allocation in two-way relay assisted cognitive radio networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Computer science; Relay; Optimization problem; Mathematical optimization; Cognitive radio; Algorithm; Computational complexity theory; Convex optimization; Power (physics); Regular polygon; Mathematics; Wireless; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001468478,0.001505892,0.001475167,0.000689109,0.0004368684,0.001118163,0.0009475856,0.001191883,0.001780518],"category_scores_gemma":[0.003448905,0.0006151478,0.0005769058,0.0009891103,0.001126933,0.001384992,0.001024956,0.001354785,0.0003958892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008108484,"about_ca_system_score_gemma":0.001122416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034873,"about_ca_topic_score_gemma":0.001790402,"domain_scores_codex":[0.9994622,0.0002799302,0.00001928998,0.00007834101,0.00009960507,0.00006059668],"domain_scores_gemma":[0.9987785,0.0009457668,0.0000840536,0.00006082239,0.0001010679,0.00002976515],"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.00003370371,0.00002516261,0.0001013299,0.00004093436,0.00002245624,0.00002092116,0.00003542654,0.9551623,0.0003053736,0.01722161,0.0009206977,0.02610999],"study_design_scores_gemma":[0.00001328139,0.0000152358,0.00002712972,0.000004659566,0.000003718993,0.000007739317,0.000007361731,0.9860209,0.0001253389,0.01348825,0.0002829444,0.00000339543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003331272,0.0002703548,0.9948378,0.00009749278,0.00001945042,0.00001977759,0.00001538462,0.0001077306,0.001300618],"genre_scores_gemma":[0.3532414,0.0008841581,0.6419057,0.0002515983,0.00009771308,0.0004535733,0.0001682671,0.0002132512,0.002784396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002034873,"threshold_uncertainty_score":0.007766128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04147790953455797,"score_gpt":0.2913436177375987,"score_spread":0.2498657082030407,"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."}}