{"id":"W2104156100","doi":"10.1109/ccece.2005.1557021","title":"Generating diverse pools of Steiner trees for VLSI routing","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Very-large-scale integration; Routing (electronic design automation); Computer science; Tree (set theory); Interconnection; Iterated function; Set (abstract data type); Spanning tree; Combinatorics; Algorithm; Mathematics; Computer network","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.0008700839,0.0004475133,0.0007160665,0.0007515642,0.0006021538,0.0004733539,0.000886292,0.0004272939,0.001741372],"category_scores_gemma":[0.001450381,0.0005171351,0.000692088,0.0009917076,0.0003208891,0.001328731,0.001301699,0.0004266204,0.000511587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003014093,"about_ca_system_score_gemma":0.0004540347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000163038,"about_ca_topic_score_gemma":0.0005750251,"domain_scores_codex":[0.9996344,0.0001213606,0.00002870442,0.0000634277,0.0001099747,0.00004206287],"domain_scores_gemma":[0.9994175,0.0002236247,0.00008118249,0.0001714135,0.0000696917,0.00003658219],"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.0003515399,0.0001152086,0.003042117,0.0002822225,0.0001429305,0.0008172998,0.000410912,0.525743,0.0990791,0.06685826,0.004432423,0.298725],"study_design_scores_gemma":[0.0001070598,0.0006670086,0.001041492,0.00003562962,0.00007108376,0.0006074068,0.0001604968,0.8678489,0.0423857,0.07447039,0.01256397,0.00004075287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1034774,0.0002594646,0.8933205,0.0000809512,0.00001502107,0.00010322,0.0001283221,0.0004962538,0.002118894],"genre_scores_gemma":[0.3649539,0.0002545223,0.6323187,0.00004789954,0.00002133527,0.0002380905,0.000547655,0.0001295029,0.001488486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001741372,"threshold_uncertainty_score":0.00582552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0132736315981807,"score_gpt":0.2151154598674411,"score_spread":0.2018418282692604,"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."}}