{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000711274,0.0007964476,0.0007492919,0.0004699048,0.0008076956,0.0009726597,0.001040799,0.0005937226,0.0007981369],"category_scores_gemma":[0.002128724,0.0003180035,0.0004081349,0.001083159,0.0005612473,0.0008893348,0.000986013,0.0005405301,0.0001297947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009754648,"about_ca_system_score_gemma":0.0009132217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005210176,"about_ca_topic_score_gemma":0.003208871,"domain_scores_codex":[0.9991788,0.0003282467,0.00003791199,0.0001583097,0.0001500085,0.0001468161],"domain_scores_gemma":[0.9991723,0.0005134787,0.0001046251,0.00007101968,0.00009272674,0.00004600443],"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.0001282627,0.00005650213,0.0007897626,0.0001034495,0.00004608378,0.0001193118,0.00008157604,0.9422059,0.004525021,0.01076347,0.0007026863,0.04047798],"study_design_scores_gemma":[0.00001137714,0.00004238454,0.0001701402,0.000006033956,0.00001222336,0.00005734754,0.00003401212,0.993408,0.001276838,0.00435104,0.0006257513,0.000004885832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1060777,0.001169212,0.886583,0.0002267521,0.00004467313,0.00008483018,0.00007018773,0.0002099001,0.005533754],"genre_scores_gemma":[0.929325,0.0005197866,0.068446,0.00007547126,0.00002340009,0.00008646454,0.00005641792,0.00002690018,0.001440662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005210176,"threshold_uncertainty_score":0.01035964,"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."}}