{"id":"W2776370065","doi":"10.1109/tgcn.2017.2786704","title":"Optimal Relay Selection and Power Control for Energy-Harvesting Wireless Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Computer science; Scheduling (production processes); Power control; Throughput; Mathematical optimization; Online algorithm; Efficient energy use; Optimization problem; Relay channel; Channel state information; Wireless; Selection algorithm; Real-time computing; Power (physics); Selection (genetic algorithm); Engineering; Algorithm; Mathematics; Electrical engineering; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004066895,0.0003145836,0.0003266392,0.0001120483,0.002721968,0.0003418428,0.0005340001,0.0002689457,0.000003693867],"category_scores_gemma":[0.000002696844,0.0003529252,0.0000931216,0.0001365497,0.0002381562,0.0003673504,0.0000154313,0.0006251626,6.212975e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006672172,"about_ca_system_score_gemma":0.00001614647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003334404,"about_ca_topic_score_gemma":0.001720407,"domain_scores_codex":[0.9985905,0.0001000656,0.0004047599,0.0003379417,0.0001141767,0.0004526111],"domain_scores_gemma":[0.997731,0.000767067,0.0001546656,0.001102173,0.00009027897,0.0001548744],"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.00003250601,0.00003016481,0.0002480854,0.00001683623,0.0001328493,8.080009e-7,0.00008180592,0.7294168,0.0001357633,0.000221417,0.00005346183,0.2696294],"study_design_scores_gemma":[0.0007851445,0.0000979547,0.0002314104,0.0002783549,0.0001042992,0.00002975934,0.0000191148,0.9930208,0.00008003016,0.00002829323,0.004960706,0.0003641026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02581772,0.001896807,0.9702863,0.0002435189,0.0006098705,0.0002382622,0.00001332996,0.0003737594,0.0005204215],"genre_scores_gemma":[0.9835825,0.004085472,0.01143061,0.00009057608,0.000268391,0.0001772706,0.000008693681,0.0001034846,0.0002529908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9588557,"threshold_uncertainty_score":0.9998923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01880251807547889,"score_gpt":0.2376646081727937,"score_spread":0.2188620900973148,"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."}}