{"id":"W1991047274","doi":"10.1109/async.2012.25","title":"High-Throughput Low-Energy Content-Addressable Memory Based on Self-Timed Overlapped Search Mechanism","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; University of Tokyo","keywords":"Computer science; Overhead (engineering); Throughput; Word (group theory); Content-addressable memory; Energy (signal processing); Dissipation; Computer hardware; CMOS; Content-addressable storage; Embedded system; Electronic engineering; Artificial intelligence; Engineering; Operating system","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.0006204938,0.0002411595,0.0002470573,0.0001414339,0.0002739844,0.0002315779,0.0006401414,0.0001392635,0.0001442491],"category_scores_gemma":[0.00002281427,0.000205355,0.00007401568,0.0005466141,0.00004358662,0.0009510351,0.0001676683,0.0001612733,0.0001258519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046741,"about_ca_system_score_gemma":0.0001303244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002460073,"about_ca_topic_score_gemma":0.00001030824,"domain_scores_codex":[0.9977275,0.0001785377,0.0002642875,0.0004728088,0.0006092024,0.0007476475],"domain_scores_gemma":[0.9986147,0.0001584587,0.00009531024,0.0006990818,0.0001730811,0.0002594052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009102117,0.00142994,0.0001983433,0.0001021764,0.00008243446,0.00001660006,0.0007777142,0.06637441,0.001476288,0.8895159,0.01594442,0.02399074],"study_design_scores_gemma":[0.00109625,0.0001355476,0.00005707088,0.00005459299,0.00001149681,0.000003870271,0.00004279355,0.942604,0.05366924,0.001398164,0.000581499,0.0003454923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002465572,0.00007753467,0.9799124,0.0007514465,0.0009522726,0.000144091,0.000001357642,0.0007594087,0.01493594],"genre_scores_gemma":[0.8093705,0.00001784902,0.1829015,0.002524131,0.000289829,0.00002635239,0.00001712509,0.00002811568,0.004824668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8881177,"threshold_uncertainty_score":0.8374135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02487416087665568,"score_gpt":0.2306194334969701,"score_spread":0.2057452726203144,"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."}}