{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014665,0.000174154,0.0001846269,0.00009075688,0.0001800806,0.0001284369,0.0003839988,0.00007726507,0.0000322624],"category_scores_gemma":[0.00005501129,0.0001700773,0.00004334039,0.0006534294,0.00006916768,0.0005938562,0.0002294585,0.0001156376,0.000002773202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009549275,"about_ca_system_score_gemma":0.00004844734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003103819,"about_ca_topic_score_gemma":0.0001151029,"domain_scores_codex":[0.9986846,0.0001724652,0.0003164403,0.0004239153,0.0001237866,0.0002787933],"domain_scores_gemma":[0.9990194,0.0001514664,0.0001070474,0.0003157861,0.0003067828,0.00009953295],"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.00008587356,0.0003347967,0.001823068,0.000005276964,0.00007179691,0.000007811373,0.001881201,0.04516039,0.00001562547,0.04148139,0.0005666202,0.9085662],"study_design_scores_gemma":[0.001221409,0.0001084588,0.01602309,0.00003482269,0.000009112103,0.0000174009,0.00006636391,0.9820553,0.00008243368,0.00008218311,0.00007910887,0.0002203177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001642917,0.0004566218,0.9943435,0.000175065,0.0002003103,0.0005010735,0.000003629287,0.0001263484,0.002550533],"genre_scores_gemma":[0.4736941,0.0003645857,0.5254506,0.0002618927,0.00003122096,0.00007798697,0.00003236932,0.000009317355,0.00007793825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9368949,"threshold_uncertainty_score":0.6935552,"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."}}