{"id":"W2804753412","doi":"10.1109/access.2018.2839190","title":"System Capacity Maximization With Efficient Resource Allocation Algorithms in D2D Communication","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cellular network; Bipartite graph; Shared resource; Algorithm; Resource allocation; Quality of service; Throughput; Interference (communication); Time-sharing; Maximization; Matching (statistics); Resource management (computing); Distributed computing; Computer network; Mathematical optimization; Theoretical computer science; Wireless; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002285971,0.0001434617,0.0001533738,0.0001701333,0.00009515555,0.00007930173,0.0003158025,0.00008844629,0.000005584387],"category_scores_gemma":[0.00001125692,0.0001417699,0.00001334324,0.0005972512,0.00005744747,0.000391197,0.00002578502,0.0001147015,0.00002906786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003681602,"about_ca_system_score_gemma":0.00001235573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297304,"about_ca_topic_score_gemma":0.0001958674,"domain_scores_codex":[0.9990838,0.00007361484,0.0002977189,0.0001940454,0.00016016,0.0001907258],"domain_scores_gemma":[0.9991797,0.0000348239,0.00009639964,0.0004846272,0.0001617615,0.00004270785],"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.00001219488,0.00001679136,0.0005403644,0.0001094628,0.000008169515,7.375631e-7,0.0005223093,0.9972159,0.0004723298,0.0001344534,0.0001025874,0.0008646559],"study_design_scores_gemma":[0.0004312275,0.00002166449,0.0008582587,0.0002608674,0.000008943127,0.000009741697,0.0001883448,0.9854881,0.01226417,0.00001020798,0.0002711602,0.0001873226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475964,0.00006432428,0.8474941,0.00001884089,0.0001995479,0.0004428973,0.000004108112,0.0004084471,0.003771299],"genre_scores_gemma":[0.9910805,0.000008719918,0.008605034,0.00001349004,0.00009998513,0.00008687023,0.00003543755,0.00004443662,0.00002551997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.843484,"threshold_uncertainty_score":0.5781211,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01882477259503235,"score_gpt":0.2452850842087785,"score_spread":0.2264603116137461,"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."}}