{"id":"W3154193021","doi":"10.1109/cjece.2004.1425804","title":"Comparisons of link-adaptation-based scheduling algorithms for the WCDMA system with high-speed downlink packet access","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Proportionally fair; Maximum throughput scheduling; Scheduling (production processes); Fair queuing; Round-robin scheduling; Link adaptation; Computer network; Telecommunications link; Fairness measure; Code division multiple access; Generalized processor sharing; Fair-share scheduling; Distributed computing; Algorithm; Wireless; Fading; Channel (broadcasting); Throughput; Quality of service; Mathematical optimization; Telecommunications","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008843431,0.0001407192,0.0002552563,0.0001984675,0.00007677351,0.00006769723,0.0001834034,0.00005797285,6.622247e-7],"category_scores_gemma":[0.00001385989,0.0001074978,0.00004939241,0.0003708201,0.00002156957,0.0001317105,0.000004541022,0.0002258532,1.074009e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001616579,"about_ca_system_score_gemma":0.0001851019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001337816,"about_ca_topic_score_gemma":0.0001750368,"domain_scores_codex":[0.9992379,0.000006544694,0.0003105188,0.00008522585,0.000103966,0.0002558591],"domain_scores_gemma":[0.999223,0.0002205973,0.00009136474,0.00008313716,0.0001626032,0.0002193235],"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.000009288215,0.000002975779,0.00008396583,0.00005933304,0.00006772613,0.000009509317,0.00004828431,0.9927307,0.00002805153,0.001018648,0.00001551689,0.005925959],"study_design_scores_gemma":[0.0007722955,0.0001281056,0.0006370683,0.0002219788,0.00003764035,0.00003889101,0.0000105204,0.9973996,0.000486489,0.0000160761,0.0001220341,0.0001293012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01971149,0.001205876,0.978496,0.0001410862,0.0002547852,0.0001482205,0.000006131431,0.00003413667,0.000002314838],"genre_scores_gemma":[0.8676176,0.00002074105,0.1319976,0.00001678332,0.0003136043,0.000003530077,0.000004123788,0.00002557558,3.625808e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8479062,"threshold_uncertainty_score":0.4383632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0119830246979466,"score_gpt":0.1967801594884708,"score_spread":0.1847971347905242,"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."}}