{"id":"W28791922","doi":"10.1007/978-3-642-35261-4_17","title":"On the Advice Complexity of Buffer Management","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Advice (programming); Computer science; Buffer (optical fiber); Competitive analysis; Computational complexity theory; Online algorithm; Operations research; Mathematical optimization; Upper and lower bounds; Algorithm; Mathematics; Telecommunications","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.003466499,0.001235107,0.001991828,0.001804607,0.002497375,0.006625039,0.003849405,0.003543923,0.02656134],"category_scores_gemma":[0.04880272,0.001494551,0.001900058,0.003631277,0.004329226,0.01780319,0.004157167,0.008479953,0.002274126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004593554,"about_ca_system_score_gemma":0.003681731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006211006,"about_ca_topic_score_gemma":0.005236727,"domain_scores_codex":[0.9944583,0.001446824,0.0003129018,0.0006912401,0.00221952,0.0008712933],"domain_scores_gemma":[0.9508079,0.0410784,0.001394847,0.003803747,0.001869375,0.001045737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002385147,0.000112981,0.0009325436,0.0003118455,0.00004934456,0.0001573844,0.0004088437,0.04387736,0.001079109,0.8834908,0.01768314,0.05165818],"study_design_scores_gemma":[0.00003448969,0.00001380062,0.0002477105,0.00004199836,0.0000306275,0.00007631262,0.00006120125,0.1040307,0.0003701633,0.8916153,0.003458475,0.00001926898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1068721,0.007890669,0.6615942,0.02276402,0.0009429859,0.0002517813,0.001442967,0.001464143,0.1967773],"genre_scores_gemma":[0.7499869,0.006685872,0.1816792,0.002017449,0.002500248,0.0004875421,0.00143659,0.001437887,0.05376828],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02656134,"threshold_uncertainty_score":0.08885658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04384029639198261,"score_gpt":0.2662340101763999,"score_spread":0.2223937137844173,"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."}}