{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003529796,0.0009259577,0.0004940036,0.0002105803,0.0003267979,0.0008267018,0.0005825501,0.0005362853,0.001845385],"category_scores_gemma":[0.0009294226,0.0002288193,0.0002829293,0.0005088967,0.0005021938,0.0005402914,0.0006878243,0.0006078554,0.0003562772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000861911,"about_ca_system_score_gemma":0.0008172659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720066,"about_ca_topic_score_gemma":0.002669976,"domain_scores_codex":[0.9997391,0.00006349142,0.000007413033,0.00004977438,0.00007759096,0.00006264917],"domain_scores_gemma":[0.9996421,0.0002202815,0.00003211997,0.00002141003,0.00006071849,0.00002323305],"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.00008910155,0.00003362761,0.0002394814,0.0001040487,0.00001839376,0.0001155837,0.00005001839,0.9450565,0.007429454,0.01880178,0.002103784,0.02595821],"study_design_scores_gemma":[0.000003287764,0.00002267552,0.00004457287,0.000003599467,0.000002742096,0.00001741274,0.00001014356,0.9956955,0.000767528,0.002977558,0.000452291,0.000002674042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01664798,0.0004488054,0.9766313,0.0002340518,0.00007035047,0.00003134576,0.00007933809,0.000134792,0.005722121],"genre_scores_gemma":[0.8678776,0.0007390301,0.1244024,0.0001832264,0.00009579192,0.0001013657,0.0001342962,0.00007394013,0.00639224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001845385,"threshold_uncertainty_score":0.00625366,"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."}}