{"id":"W2548939748","doi":"","title":"Performance analysis of Decode-and-Forward cooperative networks with best relay selection","year":2012,"lang":"en","type":"article","venue":"International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Relay channel; Decodes; Computer science; Cooperative diversity; Selection (genetic algorithm); Node (physics); Computer network; Link Access Procedure for Frame Relay; Hop (telecommunications); Topology (electrical circuits); Channel (broadcasting); Decoding methods; Power (physics); Telecommunications; Mathematics; Fading; Engineering; 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.002834952,0.001270595,0.001098197,0.001341531,0.0008834734,0.001354922,0.001054175,0.001106308,0.001263893],"category_scores_gemma":[0.009680451,0.0004235683,0.0005219466,0.001324405,0.001366784,0.001313137,0.001178884,0.0005561575,0.0002852328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002598065,"about_ca_system_score_gemma":0.001452111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01027312,"about_ca_topic_score_gemma":0.00588145,"domain_scores_codex":[0.9983399,0.000655334,0.00005197517,0.0001766781,0.0004703048,0.0003056799],"domain_scores_gemma":[0.9926944,0.00509289,0.0005546559,0.0002223049,0.001305606,0.0001301731],"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.0001467769,0.00002792755,0.001397982,0.0001187334,0.00004944703,0.000249725,0.0002692274,0.9578759,0.003234751,0.02338741,0.0008074338,0.01243465],"study_design_scores_gemma":[0.000006732166,0.00006075515,0.0002717777,0.00001058421,0.00001822867,0.00008809601,0.00005171327,0.9945623,0.0005931817,0.004113509,0.0002103347,0.00001278428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2146383,0.004404711,0.7571155,0.00103818,0.00007602141,0.0001339326,0.0002719437,0.0005032715,0.02181813],"genre_scores_gemma":[0.9847904,0.001088202,0.01210441,0.00007606357,0.00004169057,0.00008412118,0.0000769031,0.00002660591,0.001711599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01027312,"threshold_uncertainty_score":0.02042669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08105159770417639,"score_gpt":0.3338498951524105,"score_spread":0.2527982974482341,"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."}}