{"id":"W2150431092","doi":"10.1109/tvt.2012.2196532","title":"Channel Assignment With Access Contention Resolution for Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Cognitive radio; Computer science; Throughput; Channel (broadcasting); Channel allocation schemes; Algorithm; Greedy algorithm; Optimization problem; Heuristic; Assignment problem; Weapon target assignment problem; Control channel; Computational complexity theory; Generalized assignment problem; Mathematical optimization; Computer network; Wireless; Telecommunications link; Mathematics; 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.0002557495,0.0002270752,0.0002491412,0.000386245,0.0004246647,0.00009097932,0.0003164875,0.0002623903,0.000005433471],"category_scores_gemma":[0.000006859025,0.0002040678,0.000117097,0.0007613256,0.0001397693,0.0005763528,0.000005781625,0.0003714956,0.000006906219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000148153,"about_ca_system_score_gemma":0.00002835109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009528069,"about_ca_topic_score_gemma":0.00003118863,"domain_scores_codex":[0.998459,0.00006623304,0.0002167051,0.0004368488,0.0001916833,0.0006294774],"domain_scores_gemma":[0.9991552,0.0001312513,0.000117841,0.0003175794,0.0001764959,0.0001015994],"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.0009556261,0.00232826,0.0003040969,0.00006294418,0.001247135,0.00008118941,0.0005550344,0.314566,0.002416626,0.02531813,0.0005076175,0.6516573],"study_design_scores_gemma":[0.002734045,0.001123678,0.0005921753,0.0002604321,0.0001985269,0.0003064945,0.0001782293,0.952053,0.04006655,0.001088739,0.00077223,0.0006259405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01147562,0.0003690257,0.9850796,0.001087023,0.0006686019,0.0007721811,0.000006660118,0.0004540176,0.00008728223],"genre_scores_gemma":[0.9960271,0.0000774399,0.003257922,0.0001946611,0.0001137474,0.0002392764,0.000005494158,0.00002483307,0.00005955573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9845514,"threshold_uncertainty_score":0.8321643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02241118998565208,"score_gpt":0.2559649923853682,"score_spread":0.2335538023997162,"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."}}