{"id":"W2765586275","doi":"10.1109/access.2017.2763424","title":"Interference Minimization in D2D Communication Underlaying Cellular Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Interference (communication); Computer science; Knapsack problem; Resource allocation; Cellular network; Bipartite graph; Mathematical optimization; Throughput; Radio resource management; Algorithm; Shared resource; Computer network; Telecommunications; Mathematics; Wireless network; Theoretical computer science; Wireless","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.0001045758,0.0001055644,0.0001270136,0.00007707171,0.0001466221,0.0002601009,0.0006976646,0.00008696188,0.00001088147],"category_scores_gemma":[0.00002923027,0.0001222368,0.00001681769,0.00008847503,0.00002966097,0.001204857,0.00007617315,0.0001447734,0.000007345046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009326778,"about_ca_system_score_gemma":0.000006261323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007978321,"about_ca_topic_score_gemma":0.0002598848,"domain_scores_codex":[0.9994014,0.00003000541,0.0002310944,0.0001283621,0.00005404116,0.0001551039],"domain_scores_gemma":[0.9991049,0.00003859634,0.0001087891,0.0006772078,0.00004163507,0.00002888512],"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.000002926334,0.000006233634,0.005211691,0.000025242,0.000004794159,0.000001413099,0.0001296673,0.9898837,0.0005820992,0.00007187662,0.0001116255,0.003968736],"study_design_scores_gemma":[0.0002401567,0.000003593032,0.00209031,0.0001606526,0.00000420328,7.955833e-7,0.00003269645,0.9936773,0.003326716,0.0002612392,0.00005252312,0.0001498643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05292947,0.0002854224,0.9421468,0.00002816394,0.000561728,0.0001853438,9.200564e-7,0.0001412951,0.003720884],"genre_scores_gemma":[0.9981658,0.0002282781,0.001410049,0.00001310808,0.00005965975,0.00003252726,0.00001739893,0.00002965663,0.00004347586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9452364,"threshold_uncertainty_score":0.498467,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03676286205257666,"score_gpt":0.2935663075531097,"score_spread":0.256803445500533,"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."}}