{"id":"W2165102380","doi":"10.1109/iscas.1990.112038","title":"On the design of a parallel algorithm for VLSI layout compaction","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dual (grammatical number); Shortest path problem; Very-large-scale integration; Computation; Path (computing); Graph; Graph theory; Algorithm; Mathematical optimization; Theoretical computer science; Parallel computing; Mathematics; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005601043,0.001051026,0.0007883154,0.0009433918,0.0008361405,0.001160468,0.001458201,0.0008013372,0.008415253],"category_scores_gemma":[0.00188095,0.0005552015,0.0007696314,0.001515077,0.000623178,0.001483442,0.0009673937,0.0008630682,0.002645519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000817985,"about_ca_system_score_gemma":0.00124978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00167426,"about_ca_topic_score_gemma":0.002748058,"domain_scores_codex":[0.9994557,0.000101875,0.00004118164,0.0001218912,0.0002179342,0.0000613806],"domain_scores_gemma":[0.9994671,0.0002362646,0.00003684446,0.00009645295,0.0001462402,0.0000171941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002582319,0.0001449579,0.0004845362,0.000372875,0.00007318854,0.0002090693,0.0001266445,0.3010795,0.02776878,0.09585688,0.01200668,0.5616186],"study_design_scores_gemma":[0.0001244338,0.0001671682,0.000153444,0.00003017972,0.00003421151,0.0002117505,0.00004082109,0.9281597,0.00873051,0.03850032,0.02382716,0.00002043948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002067622,0.0001133119,0.9935398,0.00006709681,0.00003437277,0.00006072765,0.00002934086,0.0008184797,0.003269173],"genre_scores_gemma":[0.03392009,0.0002342338,0.9627397,0.00007767195,0.00004483529,0.0002881111,0.0001624092,0.0001599217,0.002373044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008415253,"threshold_uncertainty_score":0.02815181,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05215500958859865,"score_gpt":0.2270990695368857,"score_spread":0.1749440599482871,"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."}}