{"id":"W3010742418","doi":"10.1109/tvt.2020.2979434","title":"Delay Minimization for Massive MIMO Assisted Mobile Edge Computing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mobile edge computing; Computer science; Computational complexity theory; Base station; MIMO; Mathematical optimization; Convex optimization; Wireless; Channel state information; Resource allocation; Optimization problem; Minification; Enhanced Data Rates for GSM Evolution; Iterative method; Channel (broadcasting); Algorithm; Regular polygon; Computer network; Mathematics; Telecommunications","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.0001125623,0.0002316042,0.0002908514,0.0003316864,0.0004493963,0.00008037622,0.0007546947,0.0003267713,0.000004046693],"category_scores_gemma":[0.00002154837,0.0002440153,0.0001732527,0.001212824,0.00008446136,0.0001723964,0.00001359644,0.0003830965,0.00005605955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007305447,"about_ca_system_score_gemma":0.00007205364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002922463,"about_ca_topic_score_gemma":0.00000126152,"domain_scores_codex":[0.9983451,0.00005024227,0.0003604162,0.0006363208,0.0001716916,0.0004361909],"domain_scores_gemma":[0.9989996,0.0001355175,0.0001400572,0.0004336413,0.0001873502,0.0001038176],"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.00006267904,0.0004704464,0.00004800456,0.0001323561,0.0002498978,0.00009446545,0.001520757,0.1527491,0.02364573,0.001988083,0.005126628,0.8139119],"study_design_scores_gemma":[0.0008417023,0.0005480824,0.00001855472,0.00003794899,0.00003829272,0.00004585674,0.00006867589,0.9001321,0.08026239,0.0003248875,0.01733967,0.0003417972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02822396,0.00007602837,0.9636117,0.003470617,0.00279085,0.000573241,0.00000223166,0.001188308,0.00006308255],"genre_scores_gemma":[0.8991265,0.000005656859,0.09971667,0.0006908451,0.0002894152,0.00009988266,0.000005126208,0.0000300641,0.00003581488],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8709025,"threshold_uncertainty_score":0.9950655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01921008191638767,"score_gpt":0.2473447017618564,"score_spread":0.2281346198454687,"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."}}