{"id":"W2104727594","doi":"10.1109/iccw.2010.5503967","title":"An Efficient Multiple Relay Selection Scheme for Cognitive Radio Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Cognitive radio; Computer science; Computational complexity theory; Interference (communication); Greedy algorithm; Selection (genetic algorithm); Scheme (mathematics); Constraint (computer-aided design); Selection algorithm; Mathematical optimization; Algorithm; Computer network; Telecommunications; Wireless; Mathematics; Artificial intelligence; Channel (broadcasting); Power (physics)","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.0004103268,0.00008411864,0.00009037977,0.00006123956,0.0003205164,0.0001943452,0.0004452615,0.00005064626,0.00001405523],"category_scores_gemma":[0.0001244969,0.00007373632,0.0000332562,0.0002629452,0.00002508309,0.0002053089,0.00007393557,0.0001632908,0.00002282235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002068922,"about_ca_system_score_gemma":0.00004250773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008691652,"about_ca_topic_score_gemma":0.0001009191,"domain_scores_codex":[0.9992663,0.00007447757,0.0001446039,0.0002519632,0.0000988969,0.000163756],"domain_scores_gemma":[0.9989279,0.0002672854,0.00005085258,0.0003427265,0.0003297119,0.00008153379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005804372,0.0006997152,0.005632624,0.0000288277,0.00006529106,0.000001069768,0.002720427,0.01213781,0.2243944,0.6767426,0.002904217,0.07461503],"study_design_scores_gemma":[0.0004270155,0.00007462439,0.0008492432,0.00001080121,0.000002193061,0.000007035451,0.00004328173,0.9888989,0.004523893,0.000007974665,0.005040729,0.0001143303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1504427,0.00005872832,0.8474157,0.0001540414,0.0004894628,0.0003937421,0.000001127757,0.0002256806,0.0008187895],"genre_scores_gemma":[0.9443107,0.000009468436,0.05502512,0.00009433019,0.00009572334,0.00009197753,0.00000650021,0.000006606328,0.0003595956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.976761,"threshold_uncertainty_score":0.300688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.031068504593815,"score_gpt":0.294738244015779,"score_spread":0.263669739421964,"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."}}