{"id":"W2162098989","doi":"10.1109/iscas.2005.1465343","title":"A Hardware-Based Longest Prefix Matching Scheme for TCAMs","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Content-addressable memory; Lookup table; Computer hardware; Prefix; Content-addressable storage; Scheme (mathematics); Power consumption; Dram; Table (database); Matching (statistics); Speedup; Parallel computing; Throughput; Embedded system; Memory management; Power (physics); Phase-change memory; Operating system; Semiconductor memory","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.0001974624,0.00009414287,0.00008810441,0.00004812377,0.0001481867,0.0002568405,0.0003708251,0.00004441665,0.00001533906],"category_scores_gemma":[0.00001622648,0.00008206128,0.00004260179,0.0001899176,0.00001271972,0.0004922493,0.00004419546,0.0000545922,0.00003498987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000283664,"about_ca_system_score_gemma":0.00006616404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003717734,"about_ca_topic_score_gemma":0.00001375246,"domain_scores_codex":[0.9992303,0.0000132306,0.0001374592,0.0002663788,0.00012933,0.0002232542],"domain_scores_gemma":[0.9994808,0.00005961512,0.00005404973,0.0002639713,0.00008102632,0.00006058109],"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.00003847067,0.0002878717,0.0006269795,0.0001405432,0.00002615415,0.00000261682,0.001010977,0.3390252,0.0006240888,0.06285462,0.02206687,0.5732956],"study_design_scores_gemma":[0.0003775519,0.00003367103,0.00004175722,0.00003071629,0.000002704146,0.000001845021,0.000004821197,0.9811295,0.0026079,0.001120791,0.01450888,0.0001398393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002005898,0.00008714299,0.990841,0.003162795,0.0001193991,0.0001275199,6.288859e-7,0.0003733184,0.003282314],"genre_scores_gemma":[0.187378,0.000002149218,0.8092032,0.001343245,0.0001909021,0.00002782901,0.000006156081,0.000009411699,0.001839129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6421043,"threshold_uncertainty_score":0.3346362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01653283122052534,"score_gpt":0.2541950251287802,"score_spread":0.2376621939082548,"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."}}