{"id":"W2081574256","doi":"10.1109/jsac.2012.121026","title":"Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-Channel Multi-User Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Computer science; Relay; Channel (broadcasting); Mathematical optimization; Optimization problem; Computational complexity theory; Transmission (telecommunications); Integer programming; Hop (telecommunications); Channel allocation schemes; Dual (grammatical number); Computer network; Power (physics); Wireless; Algorithm; Telecommunications; Mathematics","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.001739903,0.001045582,0.001274482,0.0005838809,0.0004339207,0.001248057,0.0007495543,0.001181401,0.001360684],"category_scores_gemma":[0.004094759,0.000674998,0.0005450914,0.0008600648,0.0009316151,0.001323887,0.001193822,0.000812211,0.0003246593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009850763,"about_ca_system_score_gemma":0.001184289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002076825,"about_ca_topic_score_gemma":0.00219999,"domain_scores_codex":[0.9990836,0.0004890043,0.0000293595,0.0001073637,0.000155092,0.0001354542],"domain_scores_gemma":[0.9987113,0.0009090667,0.0001249617,0.00008753518,0.0001083497,0.00005871557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004721159,0.0000329116,0.0001654271,0.00003137406,0.00001362304,0.00005466392,0.0000342379,0.9830617,0.000829472,0.007560377,0.0002971526,0.007871753],"study_design_scores_gemma":[0.00001117171,0.00001837141,0.00002661228,0.000001749174,0.000004073577,0.000009821849,0.000009773765,0.9948538,0.0002476692,0.004706967,0.0001066202,0.000003407869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06842833,0.0003719704,0.9270272,0.0002816367,0.00002635012,0.00006462206,0.00008078151,0.000151692,0.003567434],"genre_scores_gemma":[0.8664631,0.0002888634,0.1309784,0.00006031559,0.00002623519,0.0001393621,0.00008035068,0.0000549603,0.001908427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002076825,"threshold_uncertainty_score":0.009201586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.100493455129988,"score_gpt":0.3370818190684847,"score_spread":0.2365883639384967,"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."}}