{"id":"W2792354310","doi":"10.1109/lcomm.2018.2804928","title":"An Optimal Real-Time Distributed Algorithm for Utility Maximization of Mobile Ad Hoc Cloud","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Wireless ad hoc network; Utility maximization; Distributed computing; Mobile ad hoc network; Maximization; Algorithm; Computer network; Wireless; Mathematical optimization; Telecommunications; Mathematics; Operating system","routes":{"ca_aff":true,"ca_fund":true,"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.00121021,0.0008198942,0.00111804,0.0003751436,0.0005744893,0.0009661544,0.001463643,0.0008704052,0.001469585],"category_scores_gemma":[0.002391533,0.0003128361,0.0004111497,0.0008762814,0.0006601244,0.001186672,0.0009624547,0.0009757752,0.0002338346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001305134,"about_ca_system_score_gemma":0.001482759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002700592,"about_ca_topic_score_gemma":0.002288001,"domain_scores_codex":[0.999275,0.0002768232,0.00002988066,0.000140753,0.0001308777,0.0001466332],"domain_scores_gemma":[0.9992769,0.000421352,0.00006302125,0.00005586196,0.0001237897,0.00005902141],"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.000171093,0.0001041345,0.0004041944,0.00008138112,0.00003602103,0.00009479783,0.00008026764,0.918977,0.002672241,0.0271197,0.001775595,0.04848349],"study_design_scores_gemma":[0.0000169929,0.00001460372,0.00002040129,0.000001686559,0.000002853245,0.00001493862,0.000008342663,0.9966031,0.000217622,0.002894872,0.0002021645,0.000002460401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01180835,0.0003046569,0.9859734,0.0001863281,0.00004246611,0.00005102874,0.00001350694,0.0001023322,0.001517968],"genre_scores_gemma":[0.7150064,0.0003295408,0.2820686,0.0001258617,0.00005984524,0.0001544811,0.00004549501,0.0000563124,0.002153459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002700592,"threshold_uncertainty_score":0.00946945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02565811695406295,"score_gpt":0.2806481304643872,"score_spread":0.2549900135103243,"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."}}