{"id":"W2144655684","doi":"10.1109/fpl.2011.67","title":"Reducing FPGA Router Run-Time through Algorithm and Architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Router; Pathfinder; Algorithm; Overhead (engineering); Parallel computing; Reduction (mathematics); Multipath routing; Static routing; Embedded system; Computer network; Routing protocol; Mathematics","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.000053185,0.0001280275,0.000123141,0.00004034047,0.00003006341,0.00001969781,0.00008044716,0.00008338077,0.000399626],"category_scores_gemma":[0.000002560748,0.0001059778,0.00002933516,0.00006102155,0.00002537179,0.0001223391,0.00002751524,0.000128713,0.00004755651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001136873,"about_ca_system_score_gemma":0.00000293372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006804802,"about_ca_topic_score_gemma":0.000001004469,"domain_scores_codex":[0.999501,0.000008774726,0.000110754,0.0001368676,0.000058306,0.0001842338],"domain_scores_gemma":[0.9997593,0.00001150093,0.000008885783,0.0001665069,0.000009845655,0.00004393003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000456517,0.00002726083,0.00004599395,0.00005691717,0.00007974004,0.00003285808,0.0061744,0.00006640739,0.02187997,0.0005901363,0.01493045,0.9561113],"study_design_scores_gemma":[0.000615979,0.0002849754,0.001282106,0.00015109,0.00006932945,0.0002992103,0.0001589464,0.03226677,0.8940614,0.03143216,0.0379737,0.001404277],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005380868,0.0003068347,0.8608525,0.00002505784,0.00008165756,0.0001376027,0.000004572067,0.001471292,0.1317396],"genre_scores_gemma":[0.1830266,0.000106974,0.8146722,0.0001642271,0.0001547319,0.00002130406,0.000004634192,0.00006111492,0.001788233],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.954707,"threshold_uncertainty_score":0.4375624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01315326071316156,"score_gpt":0.1949060365368834,"score_spread":0.1817527758237218,"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."}}