{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003094645,0.0002947323,0.0002766525,0.0004599704,0.0005448288,0.0005091829,0.001093442,0.0003905689,0.004437633],"category_scores_gemma":[0.001090856,0.0001708671,0.0001870085,0.0009797987,0.0003008698,0.000998989,0.0005373757,0.000379157,0.0008757334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005787498,"about_ca_system_score_gemma":0.0009032514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004754669,"about_ca_topic_score_gemma":0.001109365,"domain_scores_codex":[0.9996393,0.00006842974,0.00005102206,0.00005896268,0.000139506,0.00004283376],"domain_scores_gemma":[0.9995746,0.0000778658,0.00006604528,0.0001695783,0.00009610623,0.0000157652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005103446,0.0001241102,0.0006704074,0.0006145079,0.00006042218,0.0002850484,0.0001845174,0.01766692,0.3558742,0.09226486,0.01112721,0.5206175],"study_design_scores_gemma":[0.0002739948,0.001731146,0.0009715682,0.0001081831,0.0001280935,0.001637616,0.0001156659,0.2792095,0.55518,0.03701868,0.1235399,0.00008582015],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07597964,0.001634925,0.9031493,0.0004615679,0.0004564167,0.0003217725,0.0003690157,0.003906319,0.01372113],"genre_scores_gemma":[0.5238067,0.0005046845,0.4677558,0.0002668112,0.0001220141,0.0001930509,0.0002991831,0.00009640563,0.006955443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004437633,"threshold_uncertainty_score":0.01484531,"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."}}