{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227573,0.0005073163,0.000994063,0.0006390242,0.0003795406,0.000824034,0.0006680609,0.0007708031,0.001126679],"category_scores_gemma":[0.002767914,0.0005033464,0.000404201,0.0004745038,0.0009139534,0.0006573235,0.000510737,0.0005548386,0.0001252192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001012198,"about_ca_system_score_gemma":0.001881339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004663137,"about_ca_topic_score_gemma":0.002912184,"domain_scores_codex":[0.9993185,0.0003516861,0.00001495973,0.00005415146,0.0001415838,0.0001190634],"domain_scores_gemma":[0.9986207,0.001018508,0.000133787,0.00004469652,0.0001249839,0.00005728375],"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.00002211889,0.0000128143,0.0001127817,0.00001655213,0.00001015435,0.0000208717,0.00001050427,0.9922363,0.0002346725,0.003678174,0.0001038935,0.003541129],"study_design_scores_gemma":[0.00000937078,0.00001263844,0.00002916665,0.000002804681,0.000002410566,0.00000512986,0.000004687444,0.9978424,0.0001590956,0.001844,0.00008613693,0.000002229031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05962368,0.0004810053,0.9362819,0.0002052309,0.00004898685,0.00006506894,0.00003286382,0.0001553594,0.003106048],"genre_scores_gemma":[0.883352,0.0003245311,0.1148067,0.00007813594,0.00002770259,0.0001097194,0.00004500933,0.00003412605,0.0012219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004663137,"threshold_uncertainty_score":0.009271979,"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."}}