{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973769,0.0009395812,0.000974761,0.0006691461,0.0004239603,0.001004426,0.001376727,0.0008681957,0.0006994632],"category_scores_gemma":[0.005352788,0.0004096373,0.0003978725,0.00151914,0.001227826,0.001120972,0.001324,0.0006632345,0.0001578045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055896,"about_ca_system_score_gemma":0.001130709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003135946,"about_ca_topic_score_gemma":0.002222008,"domain_scores_codex":[0.998686,0.0007893744,0.00003168592,0.0001269704,0.0001935357,0.0001724115],"domain_scores_gemma":[0.9970521,0.00220227,0.0002299909,0.000174942,0.0002422823,0.00009843669],"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.00005576017,0.00003424258,0.0001726614,0.0001004395,0.00002738594,0.00008460745,0.00009929534,0.9583206,0.00175862,0.0258904,0.0009830866,0.0124728],"study_design_scores_gemma":[0.00001000588,0.00001863732,0.00003993168,0.000007597967,0.000007698351,0.0000273582,0.00002403131,0.9864223,0.0006345675,0.01242868,0.0003730789,0.000005996648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0365469,0.0008391792,0.9568026,0.0002985245,0.00003036801,0.00005096424,0.00006023932,0.0001695922,0.005201717],"genre_scores_gemma":[0.9425826,0.0006339335,0.05523756,0.00006996773,0.00004914045,0.0001377479,0.00004706056,0.00004078781,0.001201264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003135946,"threshold_uncertainty_score":0.01043838,"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."}}