{"id":"W1551546680","doi":"10.1109/ictel.2003.1191506","title":"Flow control in the presence of interference cancellation in wireless 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Maximum throughput scheduling; Computer science; Fairness measure; Network packet; Computer network; Throughput; Scheduling (production processes); Queueing theory; Telecommunications link; Single antenna interference cancellation; Fair queuing; Base station; Flow control (data); Interference (communication); Wireless network; Max-min fairness; Proportionally fair; Queue; Wireless; Round-robin scheduling; Resource allocation; Dynamic priority scheduling; Quality of service; Channel (broadcasting); Telecommunications; Engineering","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.00240846,0.0006604418,0.0007659033,0.0005400294,0.000926116,0.001712769,0.0008040851,0.0008190149,0.0004386805],"category_scores_gemma":[0.005625929,0.0004025173,0.000225555,0.000449876,0.001728782,0.001434546,0.0008744152,0.0007667888,0.00007262183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001502637,"about_ca_system_score_gemma":0.001509822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007252038,"about_ca_topic_score_gemma":0.003176763,"domain_scores_codex":[0.9990331,0.000404672,0.00003185412,0.0001413795,0.0002034365,0.0001856916],"domain_scores_gemma":[0.9963341,0.002657733,0.0003655814,0.0001113681,0.0003843029,0.0001468498],"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.0002315842,0.00008524238,0.001415467,0.00004034453,0.00002422991,0.0001645059,0.0001228661,0.9481667,0.005339155,0.0221497,0.0003722027,0.02188803],"study_design_scores_gemma":[0.00001465556,0.00003264768,0.000118306,0.000001712748,0.000007106737,0.00001709704,0.000009405823,0.9944479,0.0006939329,0.004483182,0.0001691561,0.000004942412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2736616,0.001082441,0.7196587,0.0006185731,0.0002214828,0.0000911161,0.00003879099,0.0002512159,0.004376102],"genre_scores_gemma":[0.9717662,0.0002414986,0.02659361,0.00006765399,0.0001092438,0.00004018502,0.00001551061,0.00001137655,0.00115471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007252038,"threshold_uncertainty_score":0.01441967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02250715083945887,"score_gpt":0.2718328651959636,"score_spread":0.2493257143565047,"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."}}