{"id":"W1586507268","doi":"10.1007/978-3-642-12450-1_10","title":"Parameterized Analysis of Paging and List Update Algorithms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Parameterized complexity; Locality; Cache; Locality of reference; Algorithm; Online algorithm; Set (abstract data type); Cache algorithms; Working set; Memory hierarchy; CPU cache; Theoretical computer science; Parallel computing","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001001768,0.0003241531,0.0006603852,0.001769097,0.0001683264,0.0005192497,0.001902192,0.0002367465,0.00004663484],"category_scores_gemma":[0.00007866399,0.0002881458,0.0001408355,0.001519519,0.0008744963,0.0004509516,0.001169997,0.0006659786,0.000003972703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000475874,"about_ca_system_score_gemma":0.0002130565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003388395,"about_ca_topic_score_gemma":0.00007908395,"domain_scores_codex":[0.9971992,0.00003881305,0.0005014765,0.001102275,0.0007390654,0.0004191092],"domain_scores_gemma":[0.9978235,0.0003401895,0.0003045713,0.00108061,0.0002742233,0.0001769414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006204731,0.00004005701,0.0002758371,0.00005111628,0.0001799372,0.00004205393,0.001313949,0.0571712,0.001251509,0.02041549,0.00000412965,0.9192485],"study_design_scores_gemma":[0.0001799433,0.0000550472,0.0001422145,0.00006465296,0.00004600452,0.000009346565,7.54126e-8,0.9720691,0.0008646017,0.02562484,0.0006189483,0.0003252367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001770153,0.0001553174,0.9975792,0.0006467609,0.0004670243,0.0002140712,0.000008831016,0.00007107269,0.0006807513],"genre_scores_gemma":[0.0476082,0.0001558234,0.9511716,0.0008265052,0.00006566203,0.000004501266,0.00001194246,0.00001723827,0.0001385823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9189233,"threshold_uncertainty_score":0.9999571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0174757848577018,"score_gpt":0.2632109931213892,"score_spread":0.2457352082636874,"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."}}