{"id":"W2156231566","doi":"10.1109/icc.2003.1204205","title":"On the performance and complexity of a position-based scheduling algorithm for WCDMA networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Maximum throughput scheduling; Throughput; Scheduling (production processes); Computer network; Telecommunications link; Fairness measure; Base station; Network packet; Reduction (mathematics); Wireless network; Algorithm; Wireless; Distributed computing; Quality of service; Dynamic priority scheduling; Mathematical optimization; Round-robin scheduling","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.002112315,0.000696767,0.0006115079,0.0006818537,0.0008098222,0.001082473,0.0006928223,0.0007666379,0.001026869],"category_scores_gemma":[0.01344229,0.0002429322,0.0002800088,0.0006909493,0.0008662439,0.001299645,0.0006087762,0.0009387982,0.0001773257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544867,"about_ca_system_score_gemma":0.001786132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005329159,"about_ca_topic_score_gemma":0.00408647,"domain_scores_codex":[0.9987263,0.0004361765,0.00006094793,0.0001141974,0.0005113919,0.0001509669],"domain_scores_gemma":[0.9901538,0.007808148,0.0005237748,0.0005635235,0.0008000318,0.0001507331],"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.0009380464,0.0002141409,0.002278782,0.00007491374,0.0000607976,0.0000646941,0.0001431096,0.8587947,0.01887829,0.01522665,0.000670623,0.1026552],"study_design_scores_gemma":[0.0000236125,0.000068838,0.0002121895,0.000003088968,0.000006635626,0.00001500197,0.000004903642,0.9965594,0.002171318,0.0008061936,0.0001240395,0.000004710213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3205855,0.0006815276,0.6722295,0.0004120544,0.00008841429,0.0001344057,0.00004269809,0.0006764319,0.00514956],"genre_scores_gemma":[0.8061109,0.0002325826,0.1920077,0.00007415037,0.00005883935,0.00009277852,0.00006949175,0.00006216002,0.001291529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005329159,"threshold_uncertainty_score":0.01120883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05170680507332857,"score_gpt":0.2893685704447468,"score_spread":0.2376617653714182,"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."}}