{"id":"W2170295971","doi":"10.1109/wcl.2012.051112.120277","title":"Utility-Optimal Random Access for Wireless Multimedia Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Random access; Wireless network; Quality of service; Computer network; Telecommunications link; Wireless; Transmission (telecommunications); Convex optimization; Optimization problem; Access network; Mathematical optimization; Regular polygon; Algorithm; 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.002779135,0.001045096,0.001232326,0.0006821573,0.00055666,0.00132565,0.001313205,0.0009336855,0.001938482],"category_scores_gemma":[0.008369167,0.0005237912,0.0005845836,0.001237116,0.001491887,0.00214749,0.001142596,0.001132563,0.0005346274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001856385,"about_ca_system_score_gemma":0.001507883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002395687,"about_ca_topic_score_gemma":0.002373823,"domain_scores_codex":[0.9978076,0.001447871,0.00005610339,0.0001744885,0.0003047568,0.0002092249],"domain_scores_gemma":[0.9972116,0.002173315,0.0001921318,0.0001518699,0.0001978327,0.0000732637],"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.00009099253,0.00005161697,0.0001609591,0.00006599154,0.00002080599,0.00007437211,0.00005883616,0.8738242,0.0008411602,0.1064261,0.0009818973,0.01740309],"study_design_scores_gemma":[0.00001510551,0.0000150701,0.00002031108,0.00000416846,0.000002830254,0.0000116629,0.000006724317,0.9749815,0.0001548107,0.02448492,0.0002993223,0.000003600906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01240549,0.0005106163,0.9840826,0.0002710154,0.00002776812,0.00005280103,0.0000311117,0.000155699,0.00246292],"genre_scores_gemma":[0.735662,0.001304372,0.2557895,0.000221339,0.000119557,0.0004086147,0.0001762398,0.0001501612,0.006168222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002779135,"threshold_uncertainty_score":0.01469767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0533881653453624,"score_gpt":0.3216632795835048,"score_spread":0.2682751142381424,"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."}}