{"id":"W2153287708","doi":"10.1109/icc.2012.6364528","title":"Capacity maximization in cooperative CRNs: Joint relay assignment and channel allocation","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Computer network; Channel (broadcasting); Linear network coding; Heuristic; Channel allocation schemes; Maximization; Exploit; Interference (communication); Relay channel; Coding (social sciences); Cognitive radio; Distributed computing; Mathematical optimization; Wireless; Telecommunications; 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.0005411448,0.00008967181,0.00009885986,0.00008220474,0.0001239602,0.00007789006,0.0001811811,0.00003774037,0.00002848059],"category_scores_gemma":[0.00005715219,0.00007831279,0.00001185303,0.0003023767,0.00002993991,0.0007951971,0.0002077556,0.0001076369,0.00001739074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008790009,"about_ca_system_score_gemma":0.00001793189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001237486,"about_ca_topic_score_gemma":0.00006509033,"domain_scores_codex":[0.9991654,0.0001965565,0.0001874227,0.0001650799,0.000109435,0.000176172],"domain_scores_gemma":[0.9994566,0.00004708684,0.00004850943,0.0002914826,0.00008125741,0.00007507521],"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.000008789242,0.0005161876,0.008544546,0.00001724831,0.00002680075,9.194669e-7,0.02265184,0.008476484,0.008752043,0.8858192,0.001850792,0.06333514],"study_design_scores_gemma":[0.0007717365,0.00008528698,0.08969893,0.00006954436,0.000004250571,0.00001142497,0.0002741217,0.8932818,0.01199583,0.0006136856,0.002788802,0.0004046183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02712497,0.0005052956,0.9644843,0.003141151,0.0001375294,0.0002384569,2.855426e-7,0.0000700448,0.004297914],"genre_scores_gemma":[0.9879602,0.0005573466,0.01058981,0.0005693336,0.00002698959,0.00003580988,0.000003323732,0.000003966399,0.0002532021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9608352,"threshold_uncertainty_score":0.3193503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07709855250930553,"score_gpt":0.2636572290967413,"score_spread":0.1865586765874357,"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."}}