{"id":"W1725687346","doi":"10.1007/s00453-011-9542-1","title":"Layered Working-Set Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary search tree; Binary tree; Combinatorics; Element (criminal law); Mathematics; Upper and lower bounds; Amortized analysis; Multiplicative function; Theory of computation; Set (abstract data type); Ternary search tree; Tree (set theory); Search tree; Binary number; Data structure; Discrete mathematics; Logarithm; Computer science; Search algorithm; Algorithm; Tree structure; Interval tree; Arithmetic","routes":{"ca_aff":true,"ca_fund":true,"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.001791117,0.0007661603,0.001407962,0.001494908,0.001468862,0.004206318,0.002618446,0.00185099,0.01717982],"category_scores_gemma":[0.01138822,0.0009452277,0.00162983,0.002230864,0.00157649,0.007137097,0.004137035,0.003977335,0.004012227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060072,"about_ca_system_score_gemma":0.001084794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007493118,"about_ca_topic_score_gemma":0.00140151,"domain_scores_codex":[0.9988297,0.0003278595,0.00007439373,0.0001964091,0.0003804256,0.000191201],"domain_scores_gemma":[0.9957154,0.001974912,0.0001953011,0.001347261,0.0004104864,0.0003566814],"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.0001348253,0.0001097921,0.0009314111,0.0001511366,0.00006400826,0.0001024914,0.0002388662,0.0449696,0.001897944,0.8133235,0.01222144,0.125855],"study_design_scores_gemma":[0.00001793285,0.00003079062,0.0001965743,0.00003726092,0.00003033631,0.0001210813,0.00004713713,0.1440848,0.001108644,0.8463876,0.007924133,0.00001382243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03215614,0.0007634385,0.9427376,0.0009002396,0.0001040966,0.00007143734,0.0006153397,0.0009488529,0.02170296],"genre_scores_gemma":[0.384413,0.001103323,0.5765502,0.0004519332,0.0002045645,0.0003456085,0.002182765,0.0008191745,0.03392947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01717982,"threshold_uncertainty_score":0.05747223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0813956022466798,"score_gpt":0.2568467713904636,"score_spread":0.1754511691437838,"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."}}