{"id":"W2097666774","doi":"10.1109/broadnets.2006.4374380","title":"Optimal Bandwidth Allocation for Dynamically Priced Network Services","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Heuristics; Computer science; Knapsack problem; Quality of service; Bandwidth (computing); Revenue; Bandwidth allocation; Heuristic; Mathematical optimization; Resource allocation; Service (business); Computer network; Algorithm; Mathematics","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.001602644,0.0006868754,0.00111981,0.001067293,0.0007242717,0.001545034,0.001206744,0.0009464497,0.001902301],"category_scores_gemma":[0.0045448,0.0007242013,0.0004638015,0.001068824,0.001168923,0.002133366,0.001100286,0.000900965,0.0002797438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001753025,"about_ca_system_score_gemma":0.001311577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004306667,"about_ca_topic_score_gemma":0.003917028,"domain_scores_codex":[0.9984853,0.0005924972,0.00005380241,0.0001929416,0.0002331601,0.0004423748],"domain_scores_gemma":[0.9985847,0.0008822589,0.0001621664,0.0001177823,0.0001431346,0.0001100505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002578603,0.0001227025,0.0007820006,0.00007643694,0.00003618561,0.00008847649,0.0001011445,0.9264745,0.004635923,0.02552813,0.001226969,0.04066974],"study_design_scores_gemma":[0.00003315324,0.00004458806,0.0001765257,0.000007364945,0.000009725047,0.00003602496,0.00005941404,0.9827611,0.001240703,0.01494962,0.0006709991,0.00001083662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3612152,0.001212596,0.6245021,0.0005867817,0.00007973596,0.000158895,0.0001328879,0.0004489154,0.01166284],"genre_scores_gemma":[0.9169371,0.0002626208,0.08166686,0.00005341716,0.00002222125,0.00005505765,0.00005839755,0.00005996039,0.0008844108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004306667,"threshold_uncertainty_score":0.01271921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003311846925155182,"score_gpt":0.193860584308417,"score_spread":0.1905487373832618,"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."}}