{"id":"W2104748112","doi":"10.1109/icc.2012.6364407","title":"Joint optimal relay selection and power allocation in multicast cooperative networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Unicast; Relay; Mathematical optimization; Integer programming; Optimization problem; Selection (genetic algorithm); Linear programming; Wireless network; Throughput; Computer network; Wireless; Power (physics); Mathematics; Algorithm","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.001795891,0.0008101761,0.0008888982,0.0006729109,0.0004389232,0.0009060338,0.0009719292,0.001181077,0.0005676002],"category_scores_gemma":[0.004948106,0.0005461429,0.000396305,0.0009766727,0.001136546,0.001342129,0.001054427,0.0004817519,0.0001134038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009097079,"about_ca_system_score_gemma":0.0005829275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001596689,"about_ca_topic_score_gemma":0.001334197,"domain_scores_codex":[0.9987718,0.0007704528,0.00002779499,0.0001077882,0.0001807726,0.0001414535],"domain_scores_gemma":[0.9983529,0.001323059,0.0001351935,0.00005530743,0.00008471544,0.00004881477],"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.00006940294,0.00003955,0.0002912472,0.00003733081,0.000022145,0.00008340595,0.00008128145,0.9640528,0.002236252,0.02073622,0.0003062757,0.01204405],"study_design_scores_gemma":[0.0000107432,0.00002285781,0.00003656923,0.000002294002,0.000004770375,0.00001009351,0.00001302337,0.9883012,0.0005185163,0.01096949,0.0001075363,0.000002912595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1142987,0.0004498135,0.8814935,0.0003965175,0.00001558964,0.00004392426,0.00004259413,0.000101197,0.003158204],"genre_scores_gemma":[0.9512262,0.0002599455,0.04726015,0.00005104425,0.00002510298,0.00009385931,0.0000236111,0.00002778249,0.001032369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001795891,"threshold_uncertainty_score":0.009497702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03330509314685905,"score_gpt":0.274837341893638,"score_spread":0.2415322487467789,"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."}}