{"id":"W1998843748","doi":"10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Paging; Competitive analysis; Computer science; Online algorithm; Cache; Algorithm; Randomized algorithm; CPU cache; Demand paging; Page fault; Cache algorithms; Deterministic algorithm; Virtual memory; Memory management; Parallel computing; Upper and lower bounds; Mathematics; Operating system","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.008456368,0.002406974,0.00476499,0.003563574,0.002733937,0.007423846,0.009463843,0.004494741,0.02226106],"category_scores_gemma":[0.06645808,0.001708159,0.002090433,0.006116815,0.004191719,0.01081479,0.004107141,0.005101203,0.002277697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006764665,"about_ca_system_score_gemma":0.006212964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0067073,"about_ca_topic_score_gemma":0.004054929,"domain_scores_codex":[0.9885252,0.005698818,0.0003221056,0.000980611,0.002509626,0.001963657],"domain_scores_gemma":[0.9249324,0.06067259,0.002746909,0.005265438,0.003708574,0.002673969],"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.002407546,0.001123172,0.002236378,0.0006929151,0.0001835694,0.0001359528,0.0003554326,0.3282477,0.002218177,0.5733449,0.03212961,0.05692457],"study_design_scores_gemma":[0.0002310109,0.000180212,0.00044807,0.00003816268,0.00006339152,0.00007469674,0.0000705042,0.8181441,0.0004476228,0.1779513,0.002317937,0.0000328262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553874,0.007309391,0.6126179,0.00976996,0.0007297846,0.0008840784,0.001825225,0.002229596,0.1092467],"genre_scores_gemma":[0.9041083,0.002380236,0.06945737,0.001152954,0.001317957,0.0007147567,0.001298212,0.0008247545,0.01874549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02226106,"threshold_uncertainty_score":0.07447064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008541897466011434,"score_gpt":0.2632950407095936,"score_spread":0.2547531432435822,"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."}}