{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006390199,0.0002716691,0.0003532969,0.0003418759,0.0003336702,0.0001076233,0.0004954532,0.000205032,0.00002192075],"category_scores_gemma":[0.00006631799,0.0002655665,0.0001470238,0.0001846268,0.00006995202,0.0002330822,0.000003561663,0.0005085416,0.00002528377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000327035,"about_ca_system_score_gemma":0.0001002174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005219644,"about_ca_topic_score_gemma":0.000005548763,"domain_scores_codex":[0.9982655,0.00016244,0.0004790961,0.0002815408,0.0003502766,0.0004611206],"domain_scores_gemma":[0.9984909,0.0002868646,0.0001933803,0.0008455795,0.000103845,0.00007946317],"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.00007797116,0.0001915829,0.000007467977,0.00009979432,0.0001994937,0.000006170395,0.0002598177,0.470132,0.002934056,0.0008412455,0.00009275911,0.5251576],"study_design_scores_gemma":[0.00045474,0.0008341072,0.00005026732,0.0003265038,0.00004117725,0.00001059091,0.00005733149,0.9786587,0.01897444,0.0001941531,0.0001553886,0.0002426352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004155011,0.00006185264,0.9970661,0.00005561962,0.0001913332,0.0008374181,0.00001431191,0.0009102906,0.0004476008],"genre_scores_gemma":[0.9437996,0.00001564107,0.05568183,0.00001112876,0.00006484537,0.0002878584,0.000007824362,0.00005419256,0.00007710754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9433841,"threshold_uncertainty_score":0.9999797,"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."}}