{"id":"W1738459908","doi":"10.1007/978-3-642-29222-4_10","title":"Optimal Channel Pairing and Power Allocation for Multi-channel Multi-hop Relay Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Pairing; Relay; Subcarrier; Computer science; Hop (telecommunications); Orthogonal frequency-division multiplexing; Sorting; Channel (broadcasting); Mathematical optimization; Power (physics); Computer network; Algorithm; 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.0008037232,0.0009029416,0.001347702,0.0004707532,0.0004846118,0.001251938,0.001128496,0.0008834326,0.004298118],"category_scores_gemma":[0.001571973,0.0006611579,0.000465153,0.001035548,0.0008545133,0.001197328,0.001409474,0.001204855,0.001025987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006956251,"about_ca_system_score_gemma":0.000673094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003802458,"about_ca_topic_score_gemma":0.0007867275,"domain_scores_codex":[0.9993284,0.0002921943,0.00002380826,0.00009704228,0.0001789334,0.0000796797],"domain_scores_gemma":[0.9996086,0.0002408566,0.00002402359,0.00005987903,0.00004544669,0.00002122241],"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.0001837497,0.000102432,0.0001734748,0.0001843475,0.00005594164,0.0001288633,0.0001571487,0.6228631,0.007256965,0.1679284,0.006252001,0.1947137],"study_design_scores_gemma":[0.000029785,0.00006960523,0.0001032515,0.00002798162,0.00001632147,0.0001154542,0.00003771793,0.839626,0.001862284,0.1538525,0.004236943,0.00002212019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007422179,0.001962995,0.9795105,0.0001312157,0.0001314278,0.00004367272,0.00005380824,0.0001780394,0.01056611],"genre_scores_gemma":[0.5619971,0.00417285,0.4107072,0.0001555482,0.000435728,0.000322618,0.0002393274,0.0002081243,0.0217615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004298118,"threshold_uncertainty_score":0.01437867,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05230253468132628,"score_gpt":0.2672891549076362,"score_spread":0.2149866202263099,"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."}}