{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520771,0.001258693,0.001603638,0.0009742916,0.0007316843,0.001572523,0.001624892,0.001276994,0.001958066],"category_scores_gemma":[0.003337522,0.0006184236,0.0005523018,0.0021276,0.001019035,0.001693449,0.001784195,0.0009496124,0.0004670749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001718581,"about_ca_system_score_gemma":0.001781147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005786292,"about_ca_topic_score_gemma":0.003418402,"domain_scores_codex":[0.9986902,0.0005635922,0.00005436519,0.0002067615,0.0002555001,0.000229549],"domain_scores_gemma":[0.9983565,0.001089845,0.0001575006,0.0001107159,0.0002011438,0.00008436655],"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.00007435233,0.00004104841,0.0001595705,0.00004834647,0.00002124997,0.00003422055,0.00003173032,0.9669531,0.0007869707,0.009156263,0.0008985074,0.02179468],"study_design_scores_gemma":[0.000009924094,0.00001002443,0.00002579287,0.000002411771,0.000002650197,0.000009565129,0.000006317921,0.9959447,0.000236656,0.003559193,0.0001894292,0.00000343208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01846067,0.0004696321,0.9761626,0.0002475245,0.00003850074,0.00006086756,0.00006703048,0.0003258968,0.004167403],"genre_scores_gemma":[0.7343059,0.0005494346,0.2606916,0.0002435192,0.00006147583,0.0002738594,0.0001867128,0.0001083619,0.003579246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005786292,"threshold_uncertainty_score":0.01246923,"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."}}