{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868791,0.0001066328,0.0001142064,0.00002402731,0.0001263912,0.0001594162,0.0004731898,0.00005693682,0.00001124389],"category_scores_gemma":[0.000002211275,0.00009229279,0.00005803747,0.0001976622,0.00001305131,0.0002577385,0.00004998094,0.00004554046,0.0000335221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001988262,"about_ca_system_score_gemma":0.00003624841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002256992,"about_ca_topic_score_gemma":0.0001099061,"domain_scores_codex":[0.999067,0.0000224319,0.0001987759,0.0002873595,0.0001355733,0.0002888463],"domain_scores_gemma":[0.9994034,0.0001159826,0.00006661181,0.0002528243,0.0001111447,0.00004999678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002578002,0.00006113664,0.0002783834,0.0000148101,0.0000182414,0.000001159451,0.00002715637,0.2993778,0.00008282121,0.5866203,0.006380695,0.1071117],"study_design_scores_gemma":[0.0004724755,0.00005114959,0.001604878,0.000008005799,0.000007501092,0.000002236782,0.00000329934,0.9830229,0.00001405192,0.002936365,0.01174682,0.0001303244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006478168,0.0001060233,0.9873062,0.001987805,0.000291891,0.0002899102,7.00328e-7,0.0003511469,0.00318817],"genre_scores_gemma":[0.7643817,0.000003029749,0.2324231,0.0007576538,0.000456672,0.00006591888,0.000023981,0.000007086562,0.001880861],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7579035,"threshold_uncertainty_score":0.3763591,"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."}}