{"id":"W2144604744","doi":"10.1109/vetecf.2002.1040324","title":"A distributed fair queueing architecture for CDMA networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Generalized processor sharing; Queueing theory; Scheduling (production processes); Code division multiple access; Computer network; Transmitter power output; Cellular network; Distributed computing; Power control; Shared resource; Real-time computing; Power (physics); Channel (broadcasting); Round-robin scheduling; Dynamic priority scheduling; Engineering; Quality of service; Transmitter","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.002187396,0.0006289677,0.0007768979,0.0004935819,0.001625861,0.002371947,0.00245802,0.001261593,0.003624174],"category_scores_gemma":[0.003338928,0.0003672771,0.0004682165,0.0006991436,0.001212165,0.00226194,0.001405306,0.001383824,0.0008098932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002531492,"about_ca_system_score_gemma":0.002710009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006368921,"about_ca_topic_score_gemma":0.00641665,"domain_scores_codex":[0.9991232,0.000221663,0.00005881102,0.0001530028,0.000330945,0.0001123935],"domain_scores_gemma":[0.9992353,0.0002117203,0.00003914841,0.0001667295,0.000257707,0.00008947301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004129038,0.0002553113,0.0006971302,0.0001942662,0.00009422731,0.0002107931,0.0004205031,0.3828313,0.0159729,0.4227059,0.009574681,0.16663],"study_design_scores_gemma":[0.00009728284,0.00009489778,0.00008292911,0.00002162873,0.00004279888,0.00005394592,0.00002228213,0.8944315,0.003160172,0.08307324,0.01888868,0.00003072814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008269376,0.0007851427,0.9843677,0.0004491109,0.0002885276,0.0001608365,0.00006469235,0.001248436,0.004366158],"genre_scores_gemma":[0.4401252,0.0009568765,0.5471279,0.0003177173,0.0003764429,0.0004748787,0.0001771004,0.0001088798,0.01033506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006368921,"threshold_uncertainty_score":0.01836741,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02119205268682633,"score_gpt":0.2772904526437507,"score_spread":0.2560983999569243,"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."}}