{"id":"W4293057950","doi":"10.1109/vtc2022-spring54318.2022.9860825","title":"Less Complex Algorithm to Max-Min the Resource Allocation for Unmanned Aerial Vehicles Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 95th Vehicular Technology Conference: (VTC2022-Spring)","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Quality of service; Computational complexity theory; Resource allocation; Channel (broadcasting); Optimization problem; Mathematical optimization; Channel allocation schemes; Wireless network; Bandwidth (computing); Wireless; Focus (optics); Distributed computing; Computer network; Algorithm; Mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000541231,0.0003621957,0.0003859558,0.0003882744,0.001001242,0.0001111835,0.001112197,0.0002914698,0.0001221823],"category_scores_gemma":[0.00003294314,0.0003698843,0.0001259848,0.001342074,0.0001567401,0.00008003305,0.000363698,0.0007482234,0.00002124329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002672861,"about_ca_system_score_gemma":0.00006946014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000752381,"about_ca_topic_score_gemma":0.0001012987,"domain_scores_codex":[0.9977779,0.00008148593,0.0005203055,0.0006203668,0.0003586138,0.0006413236],"domain_scores_gemma":[0.9985598,0.00008662034,0.0001363229,0.0009518879,0.0001670657,0.0000982942],"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.00004575017,0.00009935887,0.0001725808,0.0000323238,0.0001586182,0.000006989997,0.0002410068,0.8639508,0.01544246,0.0302051,0.006231118,0.08341382],"study_design_scores_gemma":[0.0006641854,0.0001366677,0.0005770131,0.00001270896,0.00006758232,0.00001385277,0.001283475,0.8375434,0.001966987,0.0009091581,0.1563821,0.0004428745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.20339,0.0004535434,0.787488,0.004125311,0.0008097822,0.002117915,0.0001124046,0.001263962,0.0002390317],"genre_scores_gemma":[0.9792765,0.00008116524,0.01497154,0.0004396763,0.0002906521,0.0043644,0.0001896017,0.0001239377,0.0002624683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7758865,"threshold_uncertainty_score":0.9998753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01686696255848276,"score_gpt":0.2252238854614255,"score_spread":0.2083569229029428,"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."}}