{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003430464,0.0001564435,0.000184868,0.00009401738,0.0006260347,0.0001941762,0.0005878384,0.00006097289,0.00008015098],"category_scores_gemma":[0.00003587286,0.0001470614,0.00007063431,0.0003527754,0.00003774241,0.0007096007,0.0001511959,0.00007040444,0.00001892347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000419461,"about_ca_system_score_gemma":0.0001068556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004215449,"about_ca_topic_score_gemma":0.0001401233,"domain_scores_codex":[0.9984761,0.00002838542,0.0002738371,0.0004387119,0.0002109404,0.0005720193],"domain_scores_gemma":[0.9991313,0.000111997,0.0001256892,0.0003778129,0.0001663402,0.00008691116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001471287,0.0007886187,0.02869812,0.001039296,0.0003964031,0.00009501789,0.01222906,0.05239903,0.002344452,0.1815009,0.2872784,0.4330835],"study_design_scores_gemma":[0.001202811,0.0000522376,0.000311553,0.00005493013,0.00001427465,0.00003784121,0.00007242217,0.9808986,0.0009342647,0.003050033,0.01301481,0.0003562416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005501306,0.0004584817,0.9877015,0.0001729545,0.0002982948,0.0002755603,0.000008446145,0.000324664,0.005258746],"genre_scores_gemma":[0.7290932,0.0001440526,0.2578824,0.0005620559,0.0001274765,0.0001440424,0.00005759679,0.00003515072,0.01195404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9284995,"threshold_uncertainty_score":0.599699,"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."}}