{"id":"W2163919934","doi":"10.1109/icn.2007.44","title":"Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Telecommunications link; Markov decision process; Computer science; Heuristic; Dynamic programming; Network packet; Scheduling (production processes); Bellman equation; Mathematical optimization; Markov process; Reduction (mathematics); Distributed computing; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506213,0.000152857,0.000217271,0.0001418934,0.00001797338,0.00001895053,0.0001918079,0.0001327046,0.0000312004],"category_scores_gemma":[0.00001931021,0.0001603186,0.00002660437,0.0005761175,0.00003262367,0.0002607955,0.00003810297,0.0001772424,0.000002716894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000894109,"about_ca_system_score_gemma":0.000007641088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002311135,"about_ca_topic_score_gemma":0.00005589778,"domain_scores_codex":[0.9989384,0.00001607596,0.0004214882,0.0001813527,0.0001371321,0.0003055215],"domain_scores_gemma":[0.999523,0.00008876916,0.00006324693,0.0002124164,0.000055592,0.00005698306],"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.00002584829,0.00003588653,0.001728772,0.00003738075,0.00001103806,0.000002035342,0.00004124493,0.9933727,0.000105039,0.001060102,0.000167973,0.003411961],"study_design_scores_gemma":[0.0004074145,0.00001219229,0.008301483,0.00002220188,0.000007406029,0.000001850397,0.00003118454,0.9899834,0.0009639772,0.00007221018,0.00002936917,0.0001672689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09246225,0.0001214256,0.9032656,0.000008890516,0.0001544883,0.0002261308,0.000002506283,0.0001908297,0.003567858],"genre_scores_gemma":[0.9283996,0.0001447348,0.07109305,0.00001741579,0.0001156868,0.000005527653,0.0001405947,0.00003834887,0.00004501674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8359374,"threshold_uncertainty_score":0.6537603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01268130509099415,"score_gpt":0.247973254536232,"score_spread":0.2352919494452379,"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."}}