{"id":"W2498120850","doi":"10.1109/twc.2016.2597283","title":"Resource Allocation for D2D Communication Underlaid Cellular Networks Using Graph-Based Approach","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Rounding; Computer science; Cellular network; Mathematical optimization; Iterative method; Graph; Algorithm; Theoretical computer science; Mathematics; Computer network","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.0004534605,0.0009617058,0.0008552521,0.0006118346,0.0005660555,0.001195459,0.0008419895,0.000679318,0.00200247],"category_scores_gemma":[0.001448311,0.0003559659,0.000471905,0.001074453,0.0006632333,0.001126146,0.0009536371,0.0007882077,0.000188531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244166,"about_ca_system_score_gemma":0.001036162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00561415,"about_ca_topic_score_gemma":0.005641836,"domain_scores_codex":[0.9994721,0.0002375533,0.00001414433,0.00007446338,0.0001218652,0.0000798184],"domain_scores_gemma":[0.9994185,0.0004103261,0.00005206835,0.00003461267,0.00005363953,0.00003093329],"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.00002678056,0.00001833684,0.0001226137,0.00004225748,0.00001740493,0.00005327763,0.00002354941,0.9730328,0.0008981556,0.01194646,0.0005517133,0.01326672],"study_design_scores_gemma":[0.000004151018,0.00000880329,0.00003177357,0.00000243353,0.000003494988,0.00001361905,0.00001335224,0.9933008,0.0001659466,0.006136894,0.0003161568,0.000002537294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02063903,0.000495695,0.9747039,0.000217371,0.00004201702,0.00005099084,0.00005537242,0.0001028079,0.003692669],"genre_scores_gemma":[0.8236818,0.0008951384,0.1725544,0.000162318,0.00004542395,0.0001215086,0.00009199249,0.00005172506,0.002395654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00561415,"threshold_uncertainty_score":0.011163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0328417463827672,"score_gpt":0.2465193856138604,"score_spread":0.2136776392310932,"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."}}