{"id":"W1993602208","doi":"10.1109/surv.2013.030713.00189","title":"Decision-Theoretic Distributed Channel Selection for Opportunistic Spectrum Access: Strategies, Challenges and Solutions","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Key (lock); Selection (genetic algorithm); Channel (broadcasting); Spectrum management; Process (computing); Game theory; Markov decision process; Wireless; Decision problem; Scarcity; Convergence (economics); Optimal decision; Markov process; Risk analysis (engineering); Operations research; Cognitive radio; Computer security; Decision tree; Computer network; Artificial intelligence; 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.003316063,0.001149057,0.001421482,0.0008647376,0.0007126195,0.0028915,0.001917975,0.001860811,0.001518946],"category_scores_gemma":[0.006710627,0.0006231543,0.0007595255,0.001454204,0.001942541,0.00256143,0.00201752,0.002285835,0.0003430567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765143,"about_ca_system_score_gemma":0.002076879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001607331,"about_ca_topic_score_gemma":0.001664051,"domain_scores_codex":[0.9978253,0.001173103,0.0001006482,0.0002611868,0.0004570858,0.0001827492],"domain_scores_gemma":[0.9952331,0.003821554,0.0002772629,0.0001914071,0.000353013,0.0001236398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009611152,0.0001383437,0.0008298327,0.0006106572,0.0001373661,0.0002157086,0.000247993,0.4154008,0.001357052,0.4685282,0.004753704,0.1076842],"study_design_scores_gemma":[0.00002397109,0.00006137103,0.0001251809,0.0000816484,0.00002295822,0.00009691079,0.00008532615,0.8056316,0.0003234769,0.1901026,0.003416426,0.00002857373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.005380466,0.008301105,0.9769726,0.002070726,0.0001369295,0.00006172356,0.00004354606,0.00006348084,0.006969487],"genre_scores_gemma":[0.7620178,0.01930056,0.2106192,0.00106492,0.0009633623,0.0004106144,0.0001231402,0.00007039424,0.005429964],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003316063,"threshold_uncertainty_score":0.01753724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1046556568954808,"score_gpt":0.3185673385802071,"score_spread":0.2139116816847263,"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."}}