{"id":"W2758109413","doi":"10.1109/iscas.2017.8050818","title":"Scalable memory-less architecture for string matching with FPGAs","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Parallel computing; Field-programmable gate array; Throughput; String (physics); Memory architecture; Content-addressable memory; Routing table; Routing (electronic design automation); Content-addressable storage; String searching algorithm; Lookup table; Computer hardware; Embedded system; Data structure; Operating system; Routing protocol","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.0001778757,0.00009303135,0.00009985073,0.00003309607,0.0007798622,0.000953769,0.000728506,0.00003344026,0.000002466315],"category_scores_gemma":[0.00001489585,0.00006652962,0.00002266096,0.00005623478,0.00003081684,0.0005338523,0.0001229079,0.00007601776,0.000002720403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001154493,"about_ca_system_score_gemma":0.00004302887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004719707,"about_ca_topic_score_gemma":0.00008077783,"domain_scores_codex":[0.9993016,0.000009273921,0.0000823423,0.0002600306,0.0001249236,0.0002218977],"domain_scores_gemma":[0.9992102,0.00003739142,0.0001014599,0.0005335007,0.0000634996,0.00005396297],"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.00003357693,0.00005075887,0.001217382,0.0001315132,0.00003428071,0.000008706334,0.001349893,0.445467,0.0002386941,0.04558853,0.001434862,0.5044448],"study_design_scores_gemma":[0.001773045,0.0001545713,0.0008314241,0.0003482864,0.00002154664,0.00004563155,0.0001481667,0.9327838,0.01424426,0.04683924,0.002172894,0.0006371317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01605253,0.00002356006,0.9737242,0.001091319,0.0001335264,0.0001171245,3.956515e-7,0.0001506071,0.00870677],"genre_scores_gemma":[0.5302897,0.000001799805,0.467243,0.0001134812,0.00009349049,0.00001101714,0.000001073771,0.000008561562,0.002237862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5142372,"threshold_uncertainty_score":0.9197217,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01775539484387704,"score_gpt":0.2490131059414327,"score_spread":0.2312577110975556,"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."}}