{"id":"W2170577117","doi":"10.1109/cwit.2007.375727","title":"Throughput and Fairness maximization in Wireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Throughput; Constraint (computer-aided design); MIMO; Scheduling (production processes); Channel (broadcasting); Computer network; Maximum throughput scheduling; Wireless; Maximization; Wireless network; Algorithm; Mathematical optimization; Mathematics; Telecommunications; Dynamic priority 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.004906404,0.001269368,0.001504843,0.001042557,0.001469756,0.002333415,0.001821356,0.001289718,0.001373522],"category_scores_gemma":[0.01038769,0.0005076728,0.0004982306,0.001960897,0.002112296,0.003142407,0.00157162,0.0009473686,0.0004182918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003201277,"about_ca_system_score_gemma":0.0024935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002447335,"about_ca_topic_score_gemma":0.001433789,"domain_scores_codex":[0.9961511,0.001815064,0.0001418465,0.0005758013,0.0007222496,0.0005939395],"domain_scores_gemma":[0.9943963,0.003863415,0.00053018,0.0003589708,0.0006632042,0.0001878557],"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.00037945,0.00006825681,0.001003593,0.0002412398,0.00009077881,0.0001950365,0.0002091417,0.768711,0.005920778,0.1844933,0.001907237,0.03678008],"study_design_scores_gemma":[0.0000244015,0.00005447814,0.0002189894,0.00002101409,0.00002126304,0.00008061212,0.00003130049,0.9279348,0.002766107,0.06722829,0.001601274,0.00001751737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02304234,0.00118844,0.9701207,0.0003956315,0.000108284,0.00005346805,0.00007765716,0.0001797369,0.004833816],"genre_scores_gemma":[0.8819194,0.00134085,0.1118249,0.0001633891,0.0003752786,0.0001705862,0.00007986708,0.0001251952,0.004000551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004906404,"threshold_uncertainty_score":0.02594781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003419626642000781,"score_gpt":0.1911571847450728,"score_spread":0.187737558103072,"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."}}