{"id":"W2158027895","doi":"10.1109/acssc.2010.5757835","title":"Admission control-based joint bandwidth and power allocation in multi-user DF relay networks","year":2010,"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":"University of Alberta","funders":"","keywords":"Greedy algorithm; Relay; Computer science; Benchmark (surveying); Bandwidth (computing); Greedy randomized adaptive search procedure; Mathematical optimization; Wireless; Power control; Bandwidth allocation; Power (physics); 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.0008040239,0.0006634282,0.0008629083,0.0004430584,0.0005500923,0.001128009,0.001222046,0.0009765741,0.0005907093],"category_scores_gemma":[0.002697565,0.000281862,0.0003770128,0.0007011266,0.0009221138,0.001233753,0.001082267,0.0006638391,0.0001396814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009015679,"about_ca_system_score_gemma":0.0009226552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003430533,"about_ca_topic_score_gemma":0.002494341,"domain_scores_codex":[0.9990488,0.000368167,0.0000520917,0.0001369928,0.0002363926,0.0001576053],"domain_scores_gemma":[0.9991667,0.0005088273,0.00009518251,0.00007681096,0.0001053237,0.00004722074],"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.0001597023,0.00006206569,0.0007292737,0.00007749301,0.00003810171,0.0001289931,0.0001544749,0.8422561,0.009352493,0.0463068,0.001134381,0.09960011],"study_design_scores_gemma":[0.000008821121,0.00003230138,0.00006913639,0.000003175703,0.000007334113,0.00003520103,0.00001286907,0.9910522,0.001009511,0.007364979,0.0003955673,0.000008877164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03603454,0.001139071,0.9599059,0.0002826995,0.00005351624,0.00004341228,0.00003058551,0.0002247613,0.002285635],"genre_scores_gemma":[0.966729,0.0004576441,0.03120735,0.00005343592,0.00005817366,0.00006844186,0.000027607,0.0000124369,0.001385928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003430533,"threshold_uncertainty_score":0.006821156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02568420318312955,"score_gpt":0.2696896526765978,"score_spread":0.2440054494934683,"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."}}