{"id":"W2144975547","doi":"10.1109/tvt.2007.897209","title":"Cooperative Fair Scheduling for the Downlink of CDMA Cellular Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Scheduling (production processes); Computer science; Code division multiple access; Computer network; Base station; Proportionally fair; Cellular network; Maximum throughput scheduling; Distributed computing; Quality of service; Round-robin scheduling; Fair-share scheduling; Mathematical optimization; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001694912,0.0005684965,0.0005180881,0.0005742542,0.001144856,0.001167232,0.0009363783,0.0006021719,0.001486323],"category_scores_gemma":[0.0047909,0.0002436283,0.0002711034,0.0006686673,0.0008464371,0.0008816868,0.0006108491,0.0005443674,0.0001512688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003196056,"about_ca_system_score_gemma":0.002305543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0187389,"about_ca_topic_score_gemma":0.01903995,"domain_scores_codex":[0.9993712,0.0002234451,0.00001789924,0.00007094398,0.0002047629,0.0001117688],"domain_scores_gemma":[0.998826,0.0007210232,0.00009453347,0.00009195175,0.0002132957,0.00005322927],"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.0001494919,0.00005052085,0.0005747358,0.00006817964,0.00003518951,0.0001522043,0.0002047617,0.8321598,0.003122364,0.1195978,0.002856119,0.04102876],"study_design_scores_gemma":[0.000008407728,0.00001535104,0.00005532846,0.000002628403,0.000005929527,0.00001299436,0.0000137566,0.9864666,0.0002698849,0.01229889,0.0008466608,0.000003587369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04133947,0.001249228,0.9521549,0.0004209373,0.0001423558,0.00009032495,0.00006731574,0.0001682877,0.004367159],"genre_scores_gemma":[0.9501536,0.0004823092,0.04575104,0.00008866072,0.0001105218,0.0001035542,0.00003707561,0.00002611764,0.003247005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0187389,"threshold_uncertainty_score":0.03725964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006682093421288449,"score_gpt":0.2165305698037418,"score_spread":0.2098484763824534,"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."}}