{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001746288,0.001053261,0.0008753822,0.000608264,0.0009795816,0.001378005,0.001563297,0.0009515945,0.00158066],"category_scores_gemma":[0.007037865,0.0003878135,0.0004878836,0.001175859,0.001664056,0.001851737,0.001160221,0.00145313,0.0002358413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482183,"about_ca_system_score_gemma":0.001979364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003175308,"about_ca_topic_score_gemma":0.002660613,"domain_scores_codex":[0.9983861,0.0006774042,0.00004290959,0.0002267189,0.000427991,0.0002387813],"domain_scores_gemma":[0.9964002,0.002769266,0.0002865613,0.0002294494,0.0002252105,0.00008925022],"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.0001375343,0.0001197482,0.0003550754,0.0001228089,0.00005114254,0.0001685183,0.0001229906,0.8581707,0.002439557,0.08875567,0.001446503,0.04810975],"study_design_scores_gemma":[0.00001745264,0.00002184457,0.00004025156,0.000004478076,0.000008004204,0.00003006164,0.00001412427,0.9807327,0.0003969833,0.01814266,0.0005852274,0.000006199502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01053603,0.0004957729,0.9867525,0.0001756867,0.00006870638,0.00005654522,0.00001293443,0.00009248011,0.001809354],"genre_scores_gemma":[0.7853213,0.0008592288,0.2101215,0.0001777677,0.0002284268,0.0003213758,0.00005065282,0.0000456294,0.002874132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003175308,"threshold_uncertainty_score":0.01075411,"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."}}