{"id":"W2500621685","doi":"10.1109/icc.2016.7511462","title":"A matching approach for power efficient relay selection in full duplex D2D networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Selection algorithm; Transmitter power output; Optimization problem; Power (physics); Matching (statistics); Power optimization; Electronic engineering; Mathematical optimization; Computer network; Algorithm; Power consumption; Engineering; Transmitter; Mathematics; Artificial intelligence","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.0007145011,0.0007465329,0.0008903832,0.0007124222,0.0005597912,0.0009683278,0.001314078,0.001008139,0.002744611],"category_scores_gemma":[0.00186867,0.0005252148,0.0007015845,0.001682441,0.0006753326,0.001595254,0.001139906,0.0007496872,0.0007012529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009913056,"about_ca_system_score_gemma":0.000875678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001112626,"about_ca_topic_score_gemma":0.0010984,"domain_scores_codex":[0.999295,0.0002551633,0.00003428569,0.0001664657,0.0001667423,0.00008227959],"domain_scores_gemma":[0.9995401,0.000241821,0.00006397787,0.0000544776,0.00006658619,0.00003308143],"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.0001414557,0.0001377448,0.0003666499,0.0001812109,0.0000765551,0.0001772964,0.0001525864,0.7248881,0.01240627,0.09080839,0.003291511,0.1673722],"study_design_scores_gemma":[0.00001973354,0.00005263597,0.00008492628,0.000006783184,0.00001346228,0.00009290725,0.00002012572,0.9714153,0.002104558,0.02447635,0.001701004,0.00001224823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004473126,0.00008962613,0.9939442,0.00005630649,0.00001235954,0.00002575375,0.00002078284,0.00007001411,0.001307838],"genre_scores_gemma":[0.4601615,0.0005321234,0.5324574,0.0001852194,0.00004570238,0.0002174905,0.0001172334,0.00007649526,0.006206911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002744611,"threshold_uncertainty_score":0.009181678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00959582224366027,"score_gpt":0.2118540488127276,"score_spread":0.2022582265690673,"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."}}