{"id":"W1996977547","doi":"10.1109/jsac.2013.130816","title":"Buffer-Aided Relaying with Adaptive Link Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":245,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Throughput; Channel state information; Relay channel; Transmission (telecommunications); Queue; Link Access Procedure for Frame Relay; Upper and lower bounds; Schedule; Selection (genetic algorithm); Power (physics); Wireless; Telecommunications; Mathematics","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.0009153734,0.000779219,0.0005445329,0.000405277,0.0003087861,0.0007482315,0.001297579,0.0007010808,0.0005468209],"category_scores_gemma":[0.002548562,0.0002305973,0.0003181521,0.0004782193,0.0005561649,0.001538743,0.0006023123,0.0003578538,0.0001282847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006021547,"about_ca_system_score_gemma":0.0006901069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298033,"about_ca_topic_score_gemma":0.001656082,"domain_scores_codex":[0.9995074,0.0001889261,0.00003078815,0.00009500689,0.0001143277,0.0000634824],"domain_scores_gemma":[0.9987704,0.0007289018,0.0001796866,0.0001353831,0.0001536013,0.00003204175],"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.0003176563,0.0001038605,0.0009740093,0.0001501703,0.00008163303,0.0005934318,0.0001845059,0.8628411,0.03200389,0.05984767,0.0005646803,0.04233749],"study_design_scores_gemma":[0.00004269715,0.0001696738,0.0001386176,0.000007366034,0.00003912234,0.0001624099,0.0000161868,0.9847426,0.005958272,0.007796398,0.0009067345,0.00001989233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1484327,0.001221332,0.8460439,0.0002564282,0.00008525817,0.0001056014,0.00006655751,0.0002958862,0.003492245],"genre_scores_gemma":[0.9405249,0.0004912639,0.05734956,0.00005411889,0.00003372055,0.0000691774,0.00003669166,0.00001104784,0.001429479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001298033,"threshold_uncertainty_score":0.00484103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07297752707014883,"score_gpt":0.3101918647511244,"score_spread":0.2372143376809756,"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."}}