{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005299384,0.0001257691,0.0001424631,0.0000716224,0.0002440385,0.0002350006,0.00151226,0.00008465366,0.0000232555],"category_scores_gemma":[0.0001579242,0.0001076555,0.00008353423,0.0006509114,0.00004725996,0.0001929223,0.0002953911,0.0002705731,0.00001116143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004747623,"about_ca_system_score_gemma":0.00007673848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000131384,"about_ca_topic_score_gemma":0.00005292513,"domain_scores_codex":[0.99858,0.0002054726,0.000202986,0.0003205616,0.0002107272,0.0004802204],"domain_scores_gemma":[0.997934,0.0005799675,0.00005181128,0.001162584,0.0001357878,0.0001358475],"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.000008672354,0.00006739536,0.000285808,0.00001154655,0.0000268092,0.000002760631,0.0001301063,0.1110734,0.00007145235,0.8059888,0.01444446,0.06788871],"study_design_scores_gemma":[0.0003722825,0.00004191811,0.0002721281,0.00001458907,0.000001671114,0.00001103062,0.00001661366,0.8674269,0.0003496936,0.009153709,0.1221542,0.0001853184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003394299,0.0002506725,0.9916545,0.002661632,0.0001112492,0.0003645297,0.00000209054,0.0002707502,0.004345118],"genre_scores_gemma":[0.8202825,0.00002686906,0.1786546,0.0003347431,0.00004881458,0.0001237902,0.00001643917,0.00001352297,0.0004987179],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8199431,"threshold_uncertainty_score":0.4390063,"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."}}