{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009446668,0.00006757886,0.00008294237,0.00003126896,0.00002501782,0.000008427752,0.00006972472,0.00003938559,0.0001939038],"category_scores_gemma":[0.000008524366,0.00004374209,0.00003873129,0.00004977152,0.00001148706,0.00003374474,0.000002702603,0.00004855923,0.00001973169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001471251,"about_ca_system_score_gemma":9.797598e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004261974,"about_ca_topic_score_gemma":3.56319e-7,"domain_scores_codex":[0.999685,0.00001300801,0.00009445686,0.00005194954,0.00005929325,0.00009627527],"domain_scores_gemma":[0.9996805,0.0001585262,0.0000128762,0.000115121,0.00001665657,0.00001628696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001669196,0.0001644582,0.00001009659,0.00006088094,0.000142762,0.000001707396,0.0006389112,0.05794301,0.01485265,0.02359347,0.5187026,0.3838727],"study_design_scores_gemma":[0.0001198369,0.0001094162,0.0000111996,0.000009343574,0.000006127445,0.000001330691,0.00002154427,0.9747587,0.0214632,0.002244588,0.001187323,0.00006734613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002482557,0.00005757595,0.991785,0.00005677253,0.00003946324,0.0003257164,0.000004019687,0.0002938086,0.007189328],"genre_scores_gemma":[0.8336334,0.00006350581,0.165167,0.0001215162,0.00004692918,0.0001141794,0.000001921091,0.00002685379,0.0008247591],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9168158,"threshold_uncertainty_score":0.212311,"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."}}