{"id":"W1988956019","doi":"10.1109/glocom.2009.5426101","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Resource allocation; Mathematical optimization; Transmission (telecommunications); Channel (broadcasting); Computational complexity theory; Range (aeronautics); Decoding methods; Linear network coding; Computer network; Algorithm; Mathematics; Telecommunications; Engineering","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.0008019583,0.0005723226,0.0006716289,0.0003266864,0.0003069768,0.0005343439,0.0006104652,0.0004991309,0.0008755974],"category_scores_gemma":[0.002633519,0.0002985695,0.0002028063,0.0004382035,0.000607686,0.0008771514,0.0006406753,0.0002954412,0.0002157922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006202215,"about_ca_system_score_gemma":0.0005141581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00151413,"about_ca_topic_score_gemma":0.001745672,"domain_scores_codex":[0.9995908,0.0002072176,0.00001812482,0.00005597247,0.00007184321,0.00005605057],"domain_scores_gemma":[0.9991975,0.0005967465,0.00005964369,0.00005460267,0.00006838117,0.00002302833],"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.000135775,0.00003429175,0.0002442274,0.00004532092,0.00001393991,0.0001137697,0.000164912,0.9299589,0.006153028,0.02778023,0.0005870134,0.03476848],"study_design_scores_gemma":[0.00002347936,0.00003995638,0.00007475856,0.000003588616,0.000008725049,0.00003629282,0.0000260545,0.9819728,0.002701238,0.01472213,0.0003845845,0.000006355968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1061364,0.0002735468,0.8902883,0.0001522128,0.00001354693,0.00004541582,0.00006538245,0.0001503116,0.002874883],"genre_scores_gemma":[0.8700969,0.000309038,0.1270921,0.00003470878,0.00001925175,0.0001435372,0.00005323082,0.00002775766,0.002223502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00151413,"threshold_uncertainty_score":0.004500031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519073622647098,"score_gpt":0.258964138700792,"score_spread":0.243773402474321,"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."}}