{"id":"W1536568986","doi":"10.1109/icc.2015.7248647","title":"A completely distributed algorithm for user association in HetSNets","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Association (psychology); Computational complexity theory; Quality of service; Time complexity; Distributed algorithm; Approximation algorithm; Algorithm; Information exchange; Order (exchange); Channel (broadcasting); Distributed computing; Computer network","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.0018364,0.0006432465,0.001558625,0.0004678499,0.0009472904,0.001021358,0.002138244,0.001559831,0.002253575],"category_scores_gemma":[0.004974041,0.0004299708,0.0006384821,0.0009888588,0.001308847,0.001582493,0.002449132,0.001295532,0.0006363025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008891154,"about_ca_system_score_gemma":0.002414569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00210918,"about_ca_topic_score_gemma":0.002110359,"domain_scores_codex":[0.9985412,0.0005176242,0.00006289257,0.0003564208,0.000305904,0.0002159304],"domain_scores_gemma":[0.9979791,0.001242249,0.0001499656,0.000249359,0.0002684391,0.0001109206],"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.0001830903,0.0001073564,0.000611029,0.00007585681,0.00005644865,0.00007376672,0.0001430615,0.839251,0.001956822,0.04187829,0.001849739,0.1138134],"study_design_scores_gemma":[0.00003975192,0.00003924509,0.00005118999,0.000003460837,0.000004876314,0.00003208469,0.0000154382,0.9856888,0.0004121147,0.01317187,0.0005347772,0.000006422931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006477539,0.00007496783,0.9922651,0.00007950082,0.00002891806,0.00003657357,0.00001051458,0.0001584132,0.0008684846],"genre_scores_gemma":[0.5308118,0.0001735512,0.4642382,0.0002021745,0.00006570158,0.0003622665,0.0001438194,0.00007430579,0.003928163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002253575,"threshold_uncertainty_score":0.009711921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08816987449417873,"score_gpt":0.3116664673804475,"score_spread":0.2234965928862688,"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."}}