{"id":"W2735848540","doi":"10.1109/icnidc.2016.7974539","title":"A computing offloading algorithm for F-RAN with limited capacity fronthaul","year":2016,"lang":"en","type":"article","venue":"","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"C-RAN; Computer science; Radio access network; Cloud computing; Quality of service; Latency (audio); Ran; Computer network; User equipment; Throughput; Distributed computing; Real-time computing; Algorithm; Wireless; Base station; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036659,0.000198266,0.0002307159,0.0001144703,0.0003099584,0.0001618272,0.0006549796,0.00006409769,0.000003338174],"category_scores_gemma":[0.00004856923,0.0001188376,0.00008105756,0.0002745876,0.00005359153,0.0004346803,0.0002114418,0.00008145343,0.00003488714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007118374,"about_ca_system_score_gemma":0.00005472554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004657692,"about_ca_topic_score_gemma":0.000005176106,"domain_scores_codex":[0.9984106,0.00003794276,0.0002421914,0.0005075359,0.0002165966,0.0005850816],"domain_scores_gemma":[0.9987127,0.0004717759,0.0001058075,0.0004137705,0.0001613053,0.0001346128],"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.000006670851,0.00004109824,0.0008195298,0.00001230118,0.00003971717,0.000006662722,0.0007456347,0.000008052545,0.00110912,0.002094783,0.005608452,0.989508],"study_design_scores_gemma":[0.002081311,0.0003347401,0.001550542,0.0002244814,0.00001434132,0.00006248778,0.00003365825,0.9656282,0.01077639,0.001589518,0.01708203,0.0006222837],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03062475,0.00001636278,0.9633425,0.0007561892,0.002400084,0.0002413089,5.726373e-7,0.000490588,0.002127627],"genre_scores_gemma":[0.1859725,8.118841e-7,0.811682,0.0003646324,0.001413224,0.000006969592,9.810915e-7,0.00001935336,0.0005395496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9888857,"threshold_uncertainty_score":0.4846056,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02487991157274704,"score_gpt":0.2244404395895652,"score_spread":0.1995605280168181,"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."}}