{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127599,0.0002507238,0.0004582563,0.0003435308,0.0002780284,0.0003433103,0.0009625875,0.0001200941,0.0000153307],"category_scores_gemma":[0.00009687094,0.000224925,0.0001790237,0.0007155436,0.0001494139,0.001370199,0.0000920617,0.000697834,0.00002531281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002423364,"about_ca_system_score_gemma":0.000895326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118523,"about_ca_topic_score_gemma":0.000003117286,"domain_scores_codex":[0.9971108,0.0001422964,0.0008574357,0.0003489121,0.0008803005,0.0006602328],"domain_scores_gemma":[0.9976364,0.00008938614,0.0004955059,0.0003695232,0.001014709,0.0003945219],"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.0001061445,0.0006386121,0.0002898316,0.0001353183,0.0001718284,0.0006908022,0.005087485,0.8587514,0.1131186,0.0005609741,0.0007300847,0.01971884],"study_design_scores_gemma":[0.01724393,0.001510539,0.0008128164,0.004044978,0.0001249369,0.004332257,0.0006591176,0.5589268,0.3919871,0.01778809,0.0004766077,0.002092744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3777918,0.0002927451,0.6202916,0.0003521951,0.0008876804,0.00009511681,0.000003235118,0.00004780413,0.0002378792],"genre_scores_gemma":[0.9715036,0.0001249847,0.02716067,0.000488748,0.0004362474,0.000001363737,0.000001113037,0.000035248,0.0002480116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5937119,"threshold_uncertainty_score":0.9172173,"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."}}