{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002158377,0.0001303402,0.0001339477,0.0001147169,0.00006632406,0.0000241466,0.0002015027,0.0001057062,0.00006102913],"category_scores_gemma":[0.00001569609,0.0001011092,0.00005379548,0.0002568606,0.00001764285,0.00007806291,0.00004499193,0.0001459827,0.00001795067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001786012,"about_ca_system_score_gemma":0.000009746454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000268534,"about_ca_topic_score_gemma":0.00009780029,"domain_scores_codex":[0.9991873,0.00002622304,0.0002394268,0.0001685288,0.00007969092,0.0002988133],"domain_scores_gemma":[0.9994435,0.0001798666,0.00002361273,0.0002740406,0.00003196452,0.00004697846],"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.00001064291,0.00004166351,0.00007256994,0.00001215532,0.00001192431,1.020519e-7,0.0001900334,0.9856718,0.009716745,0.002449142,0.0004004602,0.001422818],"study_design_scores_gemma":[0.000428881,0.0000195108,0.0006095317,0.00002782645,0.000004019268,0.000004625435,0.00008182198,0.9976988,0.0003180518,0.000005485901,0.0006422421,0.0001592165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4398642,0.00007354203,0.5585487,0.00007114561,0.00005948776,0.0002348707,0.000001639622,0.0002614806,0.0008849318],"genre_scores_gemma":[0.9629684,0.00002256983,0.0363595,0.00002029275,0.00003458294,0.0002106217,0.000007523702,0.00004530234,0.0003311778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5231043,"threshold_uncertainty_score":0.4123114,"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."}}