{"id":"W1968145044","doi":"10.1109/tcsi.2013.2283997","title":"High-Throughput Low-Energy Self-Timed CAM Based on Reordered Overlapped Search Mechanism","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; McGill University","funders":"Japan Society for the Promotion of Science; University of Tokyo","keywords":"Computer science; Asynchronous communication; Word (group theory); Throughput; Dissipation; Energy (signal processing); Electronic circuit; Computer hardware; CMOS; Electronic engineering; Electrical engineering; Mathematics; Engineering; Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003525456,0.0003258141,0.0003648212,0.0002483609,0.0005942881,0.0005577949,0.0003836981,0.0002287787,0.00003755168],"category_scores_gemma":[0.000004929731,0.0002929761,0.0001067434,0.0005820409,0.00007443327,0.0004189742,0.000003286566,0.0002315842,0.00003806863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001260591,"about_ca_system_score_gemma":0.0001795841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004421847,"about_ca_topic_score_gemma":0.00001996224,"domain_scores_codex":[0.9974292,0.0003027964,0.0003832614,0.0007640165,0.0006252016,0.0004955078],"domain_scores_gemma":[0.9985279,0.0001471613,0.0001188548,0.0007301216,0.0001763941,0.0002995317],"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.00003301364,0.0007756823,0.000005735284,0.0004170845,0.000271932,0.0000293517,0.001366409,0.7518742,0.01142795,0.04933507,0.001143243,0.1833203],"study_design_scores_gemma":[0.001267255,0.0003572881,0.00001949849,0.0002913815,0.00003091177,0.00002655299,0.0001443468,0.9903506,0.006072729,0.0003498104,0.0006119508,0.0004776811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004111406,0.00008754075,0.9912958,0.000600853,0.001240851,0.0004594249,0.0000067981,0.0004547039,0.001742595],"genre_scores_gemma":[0.995025,0.00008135301,0.002492441,0.000465561,0.00009136244,0.0001473078,0.000006198878,0.00004223678,0.001648571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9909136,"threshold_uncertainty_score":0.9999523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008486655486713809,"score_gpt":0.1940119839983482,"score_spread":0.1855253285116344,"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."}}