{"id":"W2477896399","doi":"10.1109/asicon.2015.7516961","title":"DPALS: A dynamic programming-based algorithm for two-level approximate logic synthesis","year":2015,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"China Scholarship Council","keywords":"Computer science; Reduction (mathematics); Literal (mathematical logic); Adder; Algorithm; Logic synthesis; Set (abstract data type); Boolean function; Constraint (computer-aided design); Power–delay product; Logic optimization; Function (biology); Word error rate; Logic gate; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005253013,0.000329719,0.0003405552,0.000188757,0.00006257265,0.00009633964,0.0003165458,0.000125898,0.00004490215],"category_scores_gemma":[0.00006707685,0.0002821489,0.0001135199,0.0003014674,0.00005205465,0.0002282199,0.00002655549,0.000125892,0.0001714184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002238616,"about_ca_system_score_gemma":0.00007384109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001735593,"about_ca_topic_score_gemma":0.00002263323,"domain_scores_codex":[0.9984058,0.00002416446,0.000330585,0.0003148405,0.0002701384,0.000654458],"domain_scores_gemma":[0.9990608,0.000156577,0.00004419657,0.0004018579,0.0001198234,0.0002167664],"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.00003039727,0.0001676324,0.00006632153,0.0003183306,0.0001369434,0.00001582189,0.0001961082,0.02973046,0.0007195121,0.000443147,0.00267588,0.9654995],"study_design_scores_gemma":[0.001025022,0.000106298,0.00001935157,0.00003758937,0.0000466838,0.000007074631,0.00008978948,0.984067,0.01024478,0.0002919774,0.003625975,0.0004385132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002127796,0.0002557405,0.9928316,0.00008307466,0.0004536455,0.0009806961,0.00004993516,0.001548727,0.001668816],"genre_scores_gemma":[0.2699652,0.000006000401,0.7282417,0.00008351019,0.00008606488,0.001111547,0.00003138716,0.0001187821,0.0003557594],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9650609,"threshold_uncertainty_score":0.999963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04071726683728454,"score_gpt":0.2636668748712247,"score_spread":0.2229496080339401,"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."}}