{"id":"W2619603071","doi":"10.1145/3035464","title":"A Fast Hierarchical Adaptive Analog Routing Algorithm Based on Integer Linear Programming","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Computer science; Static routing; Equal-cost multi-path routing; Multipath routing; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Policy-based routing; Routing (electronic design automation); Dynamic Source Routing; Integer programming; Distributed computing; Algorithm; Computer network; Routing protocol","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.000469832,0.0008816482,0.0008247893,0.0007291718,0.0004240414,0.0009005573,0.001209489,0.0006577812,0.004342258],"category_scores_gemma":[0.0009774044,0.0005003175,0.0006403804,0.0008356367,0.0003268562,0.001020763,0.0008086587,0.001211268,0.0007963489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006312825,"about_ca_system_score_gemma":0.001024354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003113686,"about_ca_topic_score_gemma":0.00402467,"domain_scores_codex":[0.999661,0.0000690061,0.0000195771,0.00008778184,0.0001121579,0.00005059723],"domain_scores_gemma":[0.9996953,0.0001531709,0.00004070277,0.00002629257,0.00006818915,0.00001632841],"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.0001158513,0.00009797747,0.0003772233,0.0001175808,0.00003980278,0.00008520536,0.00005908851,0.673349,0.008855174,0.01320618,0.00402422,0.2996728],"study_design_scores_gemma":[0.00001221814,0.00002156703,0.00002149893,0.000002758777,0.000004586507,0.00001282012,0.000005207949,0.9971649,0.0006579524,0.001454836,0.0006382201,0.000003436033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002882788,0.00008738309,0.9946713,0.00006161934,0.0000190732,0.00002802948,0.00001957951,0.0005885141,0.001641823],"genre_scores_gemma":[0.1123654,0.0001402109,0.8842909,0.0001436237,0.00003341054,0.0001625479,0.0001654393,0.0001544183,0.002544214],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004342258,"threshold_uncertainty_score":0.01452631,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02284596657267662,"score_gpt":0.2574228208277125,"score_spread":0.2345768542550359,"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."}}