{"id":"W2097055367","doi":"10.1109/icc.2007.959","title":"Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation","year":2007,"lang":"en","type":"article","venue":"","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Computer science; Computational complexity theory; Markov decision process; Markov process; Cognitive radio; Mathematical optimization; Truncation (statistics); Communication complexity; Markov chain; Exploit; Process (computing); Distributed computing; Markov model; Theoretical computer science; Mathematics; Algorithm; Wireless; Machine learning; 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.003158935,0.001280189,0.001921262,0.0007408529,0.0005755589,0.002154086,0.001494756,0.00181761,0.003973436],"category_scores_gemma":[0.01036403,0.0008707705,0.001272639,0.0007174829,0.002299963,0.002552849,0.001666122,0.002837679,0.0002573843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003218691,"about_ca_system_score_gemma":0.003485206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007459641,"about_ca_topic_score_gemma":0.004157728,"domain_scores_codex":[0.9976998,0.000937784,0.0001020419,0.0004104609,0.000457265,0.0003925702],"domain_scores_gemma":[0.9867721,0.01140801,0.0007093962,0.0003048616,0.000497002,0.0003086288],"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.00007336141,0.00004043357,0.000391485,0.00006626228,0.00003506303,0.0001109461,0.00005291911,0.9201267,0.0003659594,0.07511282,0.000501371,0.003122639],"study_design_scores_gemma":[0.00001954457,0.00001536592,0.00007305887,0.000007101102,0.000006689401,0.00001192807,0.00000949286,0.9599106,0.00008889318,0.03972118,0.0001300715,0.000006026713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04189338,0.0004024932,0.9481807,0.0016531,0.00005958035,0.0001303239,0.0004367106,0.00009532106,0.007148402],"genre_scores_gemma":[0.8926959,0.0008242397,0.09948091,0.0003389283,0.0001587296,0.0005218883,0.0004412864,0.00006507216,0.005472921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007459641,"threshold_uncertainty_score":0.0233534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06167129488575487,"score_gpt":0.322830655568347,"score_spread":0.2611593606825922,"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."}}