{"id":"W2162180547","doi":"10.1109/iscas.2005.1466066","title":"Fast Integer Linear Programming Based Models for VLSI Global Routing","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Router; Integer programming; Computer science; Routing (electronic design automation); Very-large-scale integration; Mathematical optimization; Pruning; Tree (set theory); Minification; Linear programming; Global optimization; Parallel computing; Algorithm; Mathematics; Computer network; Embedded system","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.0001340824,0.0001407866,0.0001305696,0.00003296021,0.00004242804,0.00004136926,0.0001176402,0.00009114356,0.00002735756],"category_scores_gemma":[0.00001194059,0.0001292665,0.00008399405,0.0001078114,0.00001149482,0.0001855584,0.00001402154,0.00007888813,0.0000140626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009837432,"about_ca_system_score_gemma":0.00001235055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001122064,"about_ca_topic_score_gemma":0.00001935614,"domain_scores_codex":[0.9992753,0.000005466372,0.0001902108,0.0001408519,0.0000854874,0.0003027135],"domain_scores_gemma":[0.9997154,0.00002372014,0.00001481747,0.0001418033,0.00004283344,0.00006144796],"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.00001045856,0.00005114232,0.0001332515,0.00008296663,0.00003237871,0.000001582929,0.0001151492,0.2873867,0.001344165,0.008578305,0.0032879,0.698976],"study_design_scores_gemma":[0.0001918227,0.00003114612,0.000003630582,0.00002429796,0.000008480189,0.000001767283,0.00003054634,0.9757096,0.01406998,0.0003579364,0.009399863,0.0001709616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001235268,0.00006116229,0.9840164,0.00008074037,0.00005017388,0.0003436617,0.000009094863,0.001930275,0.01227324],"genre_scores_gemma":[0.6619219,0.000001700122,0.3376358,0.00009441707,0.000140762,0.00006768088,0.000008123588,0.0000222823,0.0001072662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.698805,"threshold_uncertainty_score":0.5271336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01884667185012392,"score_gpt":0.2509818510131497,"score_spread":0.2321351791630258,"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."}}