{"id":"W2118254212","doi":"10.1109/tvt.2011.2165570","title":"Average Rate Maximization in Relay Networks Over Slow Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Relay; Maximization; Constraint (computer-aided design); Channel (broadcasting); Mathematical optimization; Transmission (telecommunications); Computer science; Power (physics); Optimization problem; Electronic engineering; Mathematics; Telecommunications; Engineering; Physics","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.002038229,0.001653819,0.001730388,0.0007039966,0.0004423886,0.001476195,0.0009941999,0.0009903192,0.001357222],"category_scores_gemma":[0.003983729,0.0006616136,0.000571739,0.001627589,0.001054158,0.001893453,0.0009045799,0.0008902081,0.0005098503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001229601,"about_ca_system_score_gemma":0.0009307528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002655206,"about_ca_topic_score_gemma":0.001406946,"domain_scores_codex":[0.9989356,0.0005550623,0.00004166033,0.0001598589,0.0001725377,0.0001352006],"domain_scores_gemma":[0.9978282,0.001622428,0.0001946311,0.00008147111,0.0002161508,0.00005713559],"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.00007300758,0.00001272686,0.0001353085,0.000113568,0.00003436408,0.00008868349,0.00005928861,0.9659058,0.00239882,0.01787578,0.0006807223,0.0126219],"study_design_scores_gemma":[0.00001608983,0.0000366455,0.00007357599,0.000008141072,0.00001174009,0.00003379353,0.00001921573,0.9820473,0.0009579427,0.01632873,0.000458048,0.000008753542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03316945,0.001977867,0.9610399,0.0002646637,0.00003933251,0.00002798188,0.0001079039,0.0002061214,0.003166707],"genre_scores_gemma":[0.8709462,0.0034808,0.1210096,0.00009612492,0.0001517523,0.0001520175,0.0001987681,0.0001763922,0.003788219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002655206,"threshold_uncertainty_score":0.01077932,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02694296364994075,"score_gpt":0.2364022572544672,"score_spread":0.2094592936045264,"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."}}