{"id":"W2110392972","doi":"10.1109/vetecs.2005.1543303","title":"Resource Allocation in HSDPA Using Best-Users Selection Under Code Constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Fairness measure; Computer science; Throughput; Scheduling (production processes); Max-min fairness; Resource allocation; Maximum throughput scheduling; Selection (genetic algorithm); Resource management (computing); Interference (communication); Resource (disambiguation); Computer network; Channel (broadcasting); Distributed computing; Mathematical optimization; Dynamic priority scheduling; Quality of service; Wireless; Telecommunications; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006970018,0.000101921,0.00008691511,0.0001103717,0.00003526038,0.0000162712,0.00004486483,0.00008107267,0.00008627264],"category_scores_gemma":[0.000007803231,0.0001213534,0.00001433381,0.0003269967,0.00002802489,0.0002510175,0.000007305492,0.0001154182,0.00001991554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003665604,"about_ca_system_score_gemma":0.00001450947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009818088,"about_ca_topic_score_gemma":0.0003044701,"domain_scores_codex":[0.9993833,0.00001739064,0.000187352,0.000131756,0.00008738154,0.0001928109],"domain_scores_gemma":[0.9998107,0.00002476086,0.00002293287,0.00008117752,0.00002472186,0.00003570983],"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.000003163046,0.00001127876,0.000380036,0.000005461303,0.000005551567,2.460877e-7,0.00006512757,0.985065,0.003417536,0.00062402,0.00009297147,0.01032956],"study_design_scores_gemma":[0.0002568844,0.000005659371,0.000245132,0.0000245075,0.000004937744,0.000006515011,0.0001437602,0.9948488,0.003404143,0.00005056532,0.0008738152,0.0001352133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1717626,0.00004496995,0.8235042,0.000084003,0.00004980158,0.0001351077,7.317531e-7,0.0002626823,0.004155851],"genre_scores_gemma":[0.9378313,0.00002992439,0.06178524,0.00007757003,0.00008732902,0.000005957186,0.00001221376,0.00003239384,0.000138056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7660687,"threshold_uncertainty_score":0.4948649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01608705338580975,"score_gpt":0.2450891234642882,"score_spread":0.2290020700784784,"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."}}