{"id":"W1977646040","doi":"10.1145/1167350.1167389","title":"On using conditional rotations and randomized heuristics for self-organizing ternary search tries","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Binary search tree; Trie; Ternary search tree; Computer science; Heuristic; Binary number; A priori and a posteriori; Theoretical computer science; Invariant (physics); Search problem; Set (abstract data type); Algorithm; Search algorithm; Binary tree; Search tree; Mathematics; Data structure; Mathematical optimization; Artificial intelligence; Interval tree; Arithmetic","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.002015599,0.0005698683,0.001133024,0.001398524,0.0007893175,0.001244633,0.001898138,0.000891277,0.002358863],"category_scores_gemma":[0.01029593,0.0004218455,0.0005348827,0.001960978,0.001626761,0.002474009,0.001582849,0.0007203532,0.0006880954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000930614,"about_ca_system_score_gemma":0.002028127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003079084,"about_ca_topic_score_gemma":0.004750542,"domain_scores_codex":[0.9986745,0.0006462113,0.00009314511,0.0001676631,0.0002408441,0.0001777291],"domain_scores_gemma":[0.9941915,0.003498262,0.0004756742,0.00109242,0.0004971758,0.0002448997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008106967,0.0002237215,0.002252201,0.0002489999,0.00009692286,0.00009802683,0.000434893,0.5460045,0.008017858,0.1006031,0.003229185,0.3379799],"study_design_scores_gemma":[0.0001070723,0.0002474794,0.0002901816,0.00003009128,0.00003505662,0.00008863359,0.00008186213,0.9734989,0.003393335,0.01964698,0.002536466,0.00004385066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06758478,0.0006839833,0.9253488,0.0001698165,0.00005077257,0.0002681188,0.0000777458,0.001393949,0.004422033],"genre_scores_gemma":[0.5344003,0.000387661,0.4617226,0.0002396307,0.0000583835,0.0004642089,0.0002657427,0.0002670648,0.002194315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003079084,"threshold_uncertainty_score":0.01065969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02493779807868019,"score_gpt":0.2852842621220211,"score_spread":0.2603464640433409,"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."}}