{"id":"W1985988498","doi":"10.1109/tvt.2012.2200051","title":"An Optimal Probabilistic Multiple-Access Scheme for Cognitive Radios","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Queue; Queueing theory; Network packet; Scheduling (production processes); Computer network; Transmitter power output; Channel (broadcasting); Probabilistic logic; Cognitive radio; Queuing delay; Transmission (telecommunications); Real-time computing; Transmitter; Mathematical optimization; Wireless; Telecommunications; Mathematics","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.001983933,0.001088267,0.0011447,0.0004617097,0.0007134132,0.001555393,0.001671741,0.001240811,0.001377197],"category_scores_gemma":[0.005586679,0.0005715523,0.000556118,0.0005481547,0.001370287,0.001192983,0.001267943,0.0009792295,0.0002446957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442567,"about_ca_system_score_gemma":0.001906578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004508491,"about_ca_topic_score_gemma":0.003588711,"domain_scores_codex":[0.9985971,0.0005117989,0.00004943465,0.0001997436,0.0003799129,0.0002621205],"domain_scores_gemma":[0.9980701,0.001158224,0.0002758978,0.0001092077,0.0002905501,0.0000960807],"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.0001486571,0.00006957616,0.0004722577,0.00007500661,0.00004804306,0.0001514477,0.00008325135,0.9502927,0.003353253,0.03492426,0.0004527856,0.009928863],"study_design_scores_gemma":[0.00001928272,0.00004504387,0.0000470875,0.000002898467,0.00001131251,0.00002580889,0.000008111869,0.9950257,0.0001646039,0.004506498,0.0001367887,0.000006827791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05431307,0.000580774,0.9400236,0.0003804993,0.0000767183,0.00008765926,0.00005569635,0.000179247,0.004302734],"genre_scores_gemma":[0.9605569,0.0002642692,0.03770155,0.00007023978,0.00004136499,0.00009180927,0.00001847813,0.00001169409,0.001243721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004508491,"threshold_uncertainty_score":0.01049215,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02274498271664163,"score_gpt":0.2850438040541834,"score_spread":0.2622988213375418,"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."}}