{"id":"W2097245425","doi":"10.1109/ccece.2006.277296","title":"A Dynamic Scheduling Scheme for the Revers Packet Data Channel in CDMA2000 1XEV-DV","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"CDMA2000; Computer science; Scheduling (production processes); Maximum throughput scheduling; Network packet; Proportionally fair; Computer network; Dynamic priority scheduling; Round-robin scheduling; Real-time computing; Fair queuing; Transmission delay; Fair-share scheduling; Mathematical optimization; Code division multiple access; Quality of service; 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.001033321,0.0004918248,0.0004503875,0.0004067811,0.0007101189,0.0006398173,0.001119179,0.000419828,0.0009416066],"category_scores_gemma":[0.00136798,0.0001744623,0.0002595361,0.000491277,0.0005665832,0.0005040625,0.0005324137,0.0007069656,0.0002733029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009303586,"about_ca_system_score_gemma":0.001595566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001746565,"about_ca_topic_score_gemma":0.002972889,"domain_scores_codex":[0.9994112,0.0001402399,0.00002403883,0.0001123932,0.0001998973,0.000112208],"domain_scores_gemma":[0.9994318,0.0001368245,0.0001094777,0.0001171259,0.0001485373,0.00005622655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007912004,0.000494256,0.001967269,0.0002224115,0.0000926484,0.0003804691,0.0002825723,0.2995796,0.1524599,0.1271913,0.006708164,0.4098303],"study_design_scores_gemma":[0.0001141868,0.0004806312,0.0005950668,0.00001379734,0.00005012244,0.0004677393,0.00006200331,0.9436938,0.03291623,0.009854513,0.01170073,0.00005125286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0538337,0.0004361239,0.9394453,0.0002872167,0.0002629141,0.0002680994,0.00008005439,0.0004820316,0.004904634],"genre_scores_gemma":[0.7955684,0.0003058563,0.2006283,0.0001560484,0.0001241872,0.0001452169,0.0001158351,0.0000428043,0.002913371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001746565,"threshold_uncertainty_score":0.006750226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01539072242887573,"score_gpt":0.2413682420332658,"score_spread":0.2259775196043901,"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."}}