{"id":"W2043493229","doi":"10.1109/jssc.2004.831433","title":"A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme","year":2004,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Pipeline (software); Computer science; Power (physics); Content-addressable memory; Swing; Line (geometry); Content-addressable storage; Reduction (mathematics); Binary search algorithm; Computer hardware; Search algorithm; Real-time computing; Artificial intelligence; Algorithm; Engineering; Mathematics","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.00007925239,0.0001409243,0.0001672628,0.0002758558,0.0002724649,0.0002959873,0.0009337345,0.0002607601,0.002751418],"category_scores_gemma":[0.0002906077,0.00008799459,0.000121976,0.0004693269,0.0002149252,0.0008092444,0.0002549447,0.0002100457,0.0003597481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003788729,"about_ca_system_score_gemma":0.0005057968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400314,"about_ca_topic_score_gemma":0.003241608,"domain_scores_codex":[0.9999408,0.000006238945,0.000004770181,0.00001303442,0.00002209006,0.00001314444],"domain_scores_gemma":[0.9998376,0.00003202891,0.00002759606,0.00003639548,0.00005147051,0.00001472295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005120005,0.00009576888,0.00140321,0.0003967848,0.00003376069,0.000281548,0.0001599774,0.01376615,0.5589332,0.02121661,0.006769295,0.3964317],"study_design_scores_gemma":[0.000220736,0.001609168,0.004047722,0.00005573194,0.0001761092,0.001928834,0.0001096564,0.3604028,0.5795903,0.009039154,0.04275008,0.00006977157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4652725,0.002759239,0.5036202,0.0004924549,0.0002004706,0.0002147993,0.0005789894,0.004697823,0.02216356],"genre_scores_gemma":[0.838003,0.0002311568,0.1574214,0.0001617281,0.00003165449,0.00004158476,0.0002113484,0.00003096087,0.003867146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002751418,"threshold_uncertainty_score":0.009204388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0563906129532896,"score_gpt":0.295128966455155,"score_spread":0.2387383535018654,"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."}}