{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192888,0.000318285,0.0003155712,0.0004580007,0.0002135516,0.0002070234,0.003515473,0.0001286026,0.0001380215],"category_scores_gemma":[0.00003617606,0.0002176978,0.00009908868,0.0005297145,0.001030067,0.0002942506,0.001478409,0.00054569,0.00008602987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236931,"about_ca_system_score_gemma":0.0001132028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001224953,"about_ca_topic_score_gemma":0.00001453488,"domain_scores_codex":[0.9971827,0.00006156727,0.0003904187,0.0007384949,0.001122131,0.0005047363],"domain_scores_gemma":[0.9974988,0.0004838553,0.0002266763,0.001470845,0.0001973566,0.0001225012],"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.000003405514,0.00003917719,0.000006948962,0.00003687057,0.00001146917,0.000006502152,0.0003982941,0.01915613,0.000007346225,0.8184142,0.0001272615,0.1617924],"study_design_scores_gemma":[0.0002162221,0.0001350635,0.000161364,0.0003156228,0.000006645229,0.000009935977,2.332893e-7,0.4989961,0.000318855,0.4959143,0.003526625,0.0003989852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001016076,0.000148146,0.9570855,0.002356114,0.0006332028,0.0004808441,0.000003211076,0.00008790887,0.03919487],"genre_scores_gemma":[0.1790361,0.0001822008,0.8109432,0.007212066,0.0002716875,0.00002551982,0.000006577482,0.00004577017,0.002276826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.47984,"threshold_uncertainty_score":0.8877459,"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."}}