{"id":"W2150060124","doi":"10.1109/twc.2010.07.081669","title":"Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Node (physics); Resource allocation; Mathematical optimization; Transmission (telecommunications); Decoding methods; Selection (genetic algorithm); Algorithm; Computer network; Mathematics; Telecommunications","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.0008747982,0.0005101884,0.0006085166,0.0003680349,0.0002591946,0.0004603781,0.0005942511,0.0004863335,0.0005721734],"category_scores_gemma":[0.002966053,0.0002794309,0.0002185903,0.0004930242,0.0007273843,0.0009009874,0.0006198957,0.0002940757,0.0001520032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000623854,"about_ca_system_score_gemma":0.000397725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420133,"about_ca_topic_score_gemma":0.001387285,"domain_scores_codex":[0.9996252,0.0001977643,0.00001570401,0.00005287252,0.00005828915,0.00005010497],"domain_scores_gemma":[0.9989156,0.0007848046,0.0001193999,0.00007284646,0.00007842692,0.00002891506],"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.00007549482,0.00001935562,0.0002831176,0.00002153444,0.000008937968,0.00006057277,0.0000749622,0.9740016,0.003161523,0.01076673,0.0001809944,0.01134522],"study_design_scores_gemma":[0.00001024071,0.00002878187,0.00005574831,0.000002033588,0.000003933534,0.00001451815,0.00002016049,0.9916693,0.001283644,0.006765577,0.00014261,0.000003384088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1868181,0.0002582305,0.8099598,0.0001589532,0.00001032003,0.00003701295,0.00007993836,0.0001011991,0.002576531],"genre_scores_gemma":[0.9326838,0.0002205033,0.06566958,0.00001912165,0.000009864183,0.00007356297,0.00004471404,0.0000189887,0.001259812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001420133,"threshold_uncertainty_score":0.004626453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02100030405739163,"score_gpt":0.2708555445789591,"score_spread":0.2498552405215675,"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."}}