{"id":"W2099120675","doi":"10.1109/glocom.2005.1577846","title":"Optimal packet scheduling over correlated Nakagami-m channels with different diversity-combining techniques","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nakagami distribution; Computer science; Fading; Network packet; Scheduling (production processes); Markov process; Bit error rate; Markov decision process; Markov chain; Transmission (telecommunications); Mathematical optimization; Channel (broadcasting); Algorithm; Mathematics; Computer network; Telecommunications; Statistics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001848384,0.0006701248,0.0006183827,0.0002199803,0.0008296084,0.000231035,0.001360637,0.0003666828,0.0002633747],"category_scores_gemma":[0.00002436261,0.0006896874,0.0001368433,0.0007980006,0.0002376992,0.0008355345,0.0005283909,0.0008022591,0.00008156766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008854553,"about_ca_system_score_gemma":0.00009707351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006486595,"about_ca_topic_score_gemma":0.0004077582,"domain_scores_codex":[0.9972389,0.0001400101,0.0006949416,0.0005276043,0.0004223299,0.000976228],"domain_scores_gemma":[0.9976379,0.0001162549,0.000249398,0.001388752,0.0002883471,0.0003193367],"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.00005525968,0.0002478703,0.002549863,0.00002653233,0.0002251322,0.000007104284,0.0002840291,0.9678482,0.0001436446,0.002285132,0.003834462,0.02249271],"study_design_scores_gemma":[0.001541401,0.0001484795,0.00177974,0.0003807941,0.0001490361,0.00007359081,0.0002338016,0.9813114,0.001624183,0.0003432392,0.01113452,0.001279751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4281896,0.0009475375,0.5492393,0.0007101428,0.000704201,0.001140731,0.0001892149,0.003335339,0.01554393],"genre_scores_gemma":[0.8999391,0.001709977,0.09737751,0.0001357692,0.0001484588,0.0001116723,0.00031936,0.00007421646,0.0001839771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4717495,"threshold_uncertainty_score":0.9995554,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01482366636108302,"score_gpt":0.2399280109414401,"score_spread":0.2251043445803571,"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."}}