{"id":"W2123761815","doi":"10.1109/iscas.2008.4542170","title":"A dynamic address decode circuit for implementing range addressable look-up tables","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Lookup table; Decoding methods; Scalability; Table (database); Content-addressable memory; Matching (statistics); Electronic circuit; Computer architecture; Computer hardware; Logic gate; Computer engineering; Parallel computing; Embedded system; Algorithm; Engineering; Electrical engineering","routes":{"ca_aff":true,"ca_fund":true,"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.00007524182,0.0003112357,0.0002088088,0.0002667481,0.0002339736,0.0005388398,0.0007794946,0.0003442795,0.005191227],"category_scores_gemma":[0.000431031,0.0001600778,0.0001897929,0.0002404225,0.0001633636,0.0006480304,0.0002675241,0.000338691,0.0008159777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004443027,"about_ca_system_score_gemma":0.0004594937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001035399,"about_ca_topic_score_gemma":0.002112486,"domain_scores_codex":[0.9998875,0.0000107533,0.000008898674,0.00002149184,0.00004848733,0.00002282146],"domain_scores_gemma":[0.9998635,0.00004387468,0.00001961299,0.00002639876,0.00003854475,0.000008028532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003242476,0.0001498205,0.0009775364,0.0004148595,0.00004388416,0.0006803517,0.0001978404,0.0152627,0.664543,0.03652411,0.007898787,0.2729829],"study_design_scores_gemma":[0.00009684831,0.000719741,0.001043491,0.00005482669,0.00008500005,0.001393367,0.00005482073,0.1521447,0.7941623,0.003791976,0.04639709,0.00005585455],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2291739,0.0009857985,0.725871,0.0004478031,0.0002895698,0.0004112146,0.0006082315,0.009865551,0.03234701],"genre_scores_gemma":[0.7552277,0.000349286,0.2279851,0.0002688968,0.00004745681,0.0001584532,0.0004408197,0.0002629548,0.01525928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005191227,"threshold_uncertainty_score":0.01736641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0440017271489153,"score_gpt":0.2787664733400701,"score_spread":0.2347647461911548,"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."}}