{"id":"W2167881201","doi":"10.1109/ccece.2008.4564673","title":"An effective congestion-based integer programming model for VLSI global routing","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Integer programming; Computer science; Very-large-scale integration; Routing (electronic design automation); Router; Parallel computing; Steiner tree problem; Mathematical optimization; Algorithm; Computer network; Mathematics; Embedded system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.001296166,0.001023414,0.0007498351,0.0004253421,0.0003960559,0.001143952,0.0015296,0.0009210874,0.003220206],"category_scores_gemma":[0.00180401,0.0005886338,0.00095075,0.0009330293,0.0007060829,0.001778435,0.0009440333,0.001986697,0.0004819278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007774627,"about_ca_system_score_gemma":0.001387912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002049051,"about_ca_topic_score_gemma":0.002831156,"domain_scores_codex":[0.9994832,0.000190519,0.00002071397,0.00007881087,0.0001594492,0.00006725697],"domain_scores_gemma":[0.9995655,0.0002887848,0.00003785754,0.0000249705,0.00006078585,0.00002201513],"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.00002528958,0.00002783411,0.00007372363,0.00003958655,0.0000104612,0.00004849192,0.00003322278,0.9200852,0.000863691,0.06679496,0.0008717976,0.01112581],"study_design_scores_gemma":[0.000006792618,0.00001265866,0.000009125748,0.000002394556,0.000002701618,0.000006617649,0.000003284023,0.9900813,0.0001139852,0.009112556,0.0006464087,0.000002154164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003395126,0.0001283031,0.9934856,0.0001547519,0.00002677237,0.00003015943,0.00004794789,0.0000824235,0.002648798],"genre_scores_gemma":[0.3671886,0.0008197182,0.6193002,0.0002209329,0.0001216422,0.0005625417,0.0002710556,0.0001666987,0.01134854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003220206,"threshold_uncertainty_score":0.01077265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01575072268814795,"score_gpt":0.212242527783285,"score_spread":0.1964918050951371,"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."}}