{"id":"W2012846815","doi":"10.1145/2451916.2451956","title":"Buffer sizing for clock networks using robust geometric programming considering variations in buffer sizes","year":2013,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Western Canada Research Grid; Compute Canada","keywords":"Sizing; Clock network; Skew; Buffer (optical fiber); Heuristics; Robustness (evolution); Geometric programming; Computer science; Mathematical optimization; Linear programming; Clock skew; Timing failure; Power (physics); Parallel computing; Algorithm; Jitter; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203636,0.0003119277,0.0003536452,0.000634322,0.0001577941,0.000261474,0.0001868639,0.0001975491,0.0001867081],"category_scores_gemma":[0.0001259864,0.0003089455,0.0000869845,0.001327812,0.00002976311,0.0008196112,0.00005937941,0.0002797801,0.00003730566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002566784,"about_ca_system_score_gemma":0.00003227484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002732381,"about_ca_topic_score_gemma":0.00007076212,"domain_scores_codex":[0.9981042,0.00002357124,0.0005397263,0.0003121228,0.000177931,0.0008424308],"domain_scores_gemma":[0.9989643,0.0004519351,0.00005585441,0.0002931273,0.0001121521,0.000122665],"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.000003143235,0.00003143171,0.006727526,0.0001034689,0.00005733395,0.000002404168,0.0001728949,0.9794139,0.001510421,0.0003900587,0.0004629942,0.01112439],"study_design_scores_gemma":[0.0006444927,0.00002944258,0.003907712,0.00007516766,0.00002948341,0.000008665528,0.0001182289,0.9924438,0.001227885,0.00007965718,0.0009961784,0.0004392721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2673381,0.0006297728,0.7290788,0.00004143623,0.0006160088,0.001207661,0.000001545506,0.0005712564,0.0005154932],"genre_scores_gemma":[0.8431514,0.00003535343,0.1560866,0.00005076412,0.0002070789,0.000287816,0.000007309422,0.00009347926,0.00008018188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5758134,"threshold_uncertainty_score":0.9999363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02583528047665263,"score_gpt":0.2179349536066769,"score_spread":0.1920996731300243,"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."}}