{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003743182,0.0001095773,0.000160987,0.00007603525,0.0003084156,0.00007551484,0.002091892,0.00004947127,0.00000733512],"category_scores_gemma":[0.00001935695,0.0001177479,0.00008609657,0.0002841848,0.0002538431,0.0003728217,0.000193205,0.0000940916,0.00001587168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004657406,"about_ca_system_score_gemma":0.000040239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005090038,"about_ca_topic_score_gemma":0.000008509825,"domain_scores_codex":[0.9989456,0.0001861337,0.0002953791,0.0002511891,0.0001369828,0.0001847161],"domain_scores_gemma":[0.9965892,0.0001746224,0.0001591616,0.00274468,0.0002687878,0.00006348871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009386265,0.001240164,0.0002412134,0.00003082503,0.000160924,0.000001682785,0.003355868,0.002069714,0.2321138,0.001060213,0.030696,0.7289358],"study_design_scores_gemma":[0.0003581961,0.0002007185,0.0004035552,0.00001775301,0.00001888357,0.000003532002,0.00004471686,0.9899496,0.003034107,0.00007573189,0.005731719,0.000161456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1144164,0.0001196292,0.8833041,0.001284966,0.000204131,0.0002938366,0.0001519275,0.0001691839,0.00005577221],"genre_scores_gemma":[0.6712396,0.00015897,0.327608,0.000419417,0.00008571044,0.0001202883,0.000323232,0.00001382593,0.00003101444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9878799,"threshold_uncertainty_score":0.4801619,"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."}}