{"id":"W2109483310","doi":"10.1109/issse.2007.4294496","title":"Efficient Buffer Tree Creation Using Mixed Branch and Bound and Dynamic Programming Techniques","year":2007,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Dynamic programming; Buffer (optical fiber); Tree (set theory); Set (abstract data type); Branch and bound; Parallel computing; Mathematical optimization; Algorithm; 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.0005520846,0.0008568477,0.000641809,0.0009335486,0.0005807838,0.001538312,0.00123469,0.0006234382,0.004177126],"category_scores_gemma":[0.002057964,0.0005456101,0.0004113865,0.001340495,0.0004420016,0.00220397,0.00120574,0.0009586292,0.0008390596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007178143,"about_ca_system_score_gemma":0.001321655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521966,"about_ca_topic_score_gemma":0.003687184,"domain_scores_codex":[0.9995322,0.00008103138,0.00002601876,0.00008372248,0.0002022809,0.00007478656],"domain_scores_gemma":[0.9992319,0.0004301488,0.00008215671,0.0000987596,0.0001173894,0.000039682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003259231,0.0001991265,0.0009171274,0.0002308107,0.00006918564,0.0001591194,0.0001886218,0.1976636,0.06892885,0.06152167,0.004963463,0.6648325],"study_design_scores_gemma":[0.0000624251,0.00009526674,0.0001658322,0.00002378688,0.0000334829,0.0001355675,0.00002456849,0.9444456,0.02976204,0.02118911,0.004041449,0.00002091761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008247633,0.0001375107,0.9893292,0.00006982939,0.00001196131,0.00003258826,0.00002390455,0.0006813219,0.001466156],"genre_scores_gemma":[0.1174289,0.0001662637,0.8792813,0.00006650829,0.00002076674,0.0001214716,0.0001218909,0.0002550679,0.002537867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004177126,"threshold_uncertainty_score":0.01397389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006400269370008579,"score_gpt":0.2331083782251331,"score_spread":0.2267081088551245,"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."}}