{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158397,0.0007001104,0.0007076198,0.0004947954,0.0006304438,0.001141698,0.0008054797,0.0004010327,0.0006470475],"category_scores_gemma":[0.003394137,0.0003022464,0.0002305678,0.0008070536,0.0007313615,0.0008479838,0.0007454494,0.0004003709,0.0001656698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000604254,"about_ca_system_score_gemma":0.001405572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003772163,"about_ca_topic_score_gemma":0.004378874,"domain_scores_codex":[0.9988533,0.0005391886,0.00003404752,0.0001089839,0.0003071249,0.0001574023],"domain_scores_gemma":[0.9986628,0.000799594,0.0001250734,0.0001183017,0.000214617,0.00007951901],"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.0003174948,0.000118863,0.002234307,0.0001079681,0.00006929067,0.0003697633,0.0001608353,0.8318316,0.01379882,0.02825388,0.00162706,0.12111],"study_design_scores_gemma":[0.0000319552,0.00009043881,0.00037803,0.000005679177,0.00001477829,0.0001548804,0.00002205507,0.9877915,0.003628444,0.007001778,0.0008633893,0.00001714171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08349936,0.0006923725,0.9123048,0.0001528519,0.0000516189,0.00007005483,0.00005521388,0.0001545882,0.003019165],"genre_scores_gemma":[0.8939856,0.0003429007,0.1041963,0.00005391229,0.00004500268,0.00008214224,0.00002869082,0.00002571949,0.001239592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003772163,"threshold_uncertainty_score":0.00750041,"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."}}