{"id":"W2100036317","doi":"10.1109/twc.2009.071359","title":"Utility-optimal random access: Reduced complexity, fast convergence, and robust performance","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Subgradient method; Asynchronous communication; Distributed algorithm; Distributed coordination function; Robustness (evolution); Wireless ad hoc network; Convergence (economics); Random access; Wireless network; Distributed computing; Wireless; Mathematical optimization; Algorithm; Computer network; IEEE 802.11; 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.003220422,0.000915667,0.001540647,0.0007314867,0.0004700992,0.001292328,0.002027164,0.0008564795,0.00109347],"category_scores_gemma":[0.01130507,0.0004490273,0.0005724481,0.0007562789,0.001263356,0.001935321,0.001665432,0.001358983,0.0005175578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009983558,"about_ca_system_score_gemma":0.001518533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001212717,"about_ca_topic_score_gemma":0.0008949583,"domain_scores_codex":[0.9972221,0.001362323,0.000117566,0.0003355295,0.0007378823,0.0002247038],"domain_scores_gemma":[0.9963529,0.001971815,0.0004309224,0.0005910126,0.0005238139,0.0001295381],"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.0002846516,0.0001297633,0.0004950895,0.0001203952,0.00006259182,0.00009077055,0.0001283019,0.7690525,0.003981298,0.1022458,0.001638,0.1217709],"study_design_scores_gemma":[0.0000341226,0.0000445198,0.00004269244,0.000003757334,0.000006091571,0.00004052144,0.000005783434,0.9912982,0.0007914971,0.007326395,0.0003980109,0.000008590631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005013597,0.0001894035,0.9934732,0.00009566527,0.00001998554,0.00003203319,0.000007324317,0.0002504345,0.0009182461],"genre_scores_gemma":[0.5776312,0.0004325034,0.4188361,0.0001577051,0.00009356182,0.0002874921,0.00006283558,0.0001150344,0.002383522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003220422,"threshold_uncertainty_score":0.01703143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07501901322174132,"score_gpt":0.3077144191367041,"score_spread":0.2326954059149627,"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."}}