{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005371706,0.0008984062,0.0007282048,0.0009647425,0.000468975,0.00105859,0.001384261,0.0008630291,0.004624724],"category_scores_gemma":[0.001616881,0.0005427786,0.000787827,0.0008597149,0.0006518715,0.0008806927,0.001288582,0.001350339,0.000911484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008800715,"about_ca_system_score_gemma":0.001231877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002518529,"about_ca_topic_score_gemma":0.003677101,"domain_scores_codex":[0.9995889,0.00009636264,0.00002435625,0.00007549135,0.0001653776,0.0000495141],"domain_scores_gemma":[0.9996018,0.0002419312,0.00003082461,0.00004855597,0.00006127639,0.00001558243],"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.0001573001,0.00008363663,0.0003486379,0.0001917032,0.00004524923,0.00007945396,0.00008325194,0.5435701,0.0131253,0.04075813,0.003583035,0.3979743],"study_design_scores_gemma":[0.00002713853,0.00003415614,0.00002168597,0.000009036755,0.000006613102,0.00002567097,0.000006997896,0.9864482,0.00246706,0.008575152,0.002372411,0.000005742238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001761989,0.00005914784,0.9962471,0.00003805507,0.0000112619,0.00003142025,0.00002768964,0.0007124906,0.001110939],"genre_scores_gemma":[0.0783851,0.0001094646,0.9193949,0.00008698546,0.0000151681,0.0002560371,0.0001702412,0.000201188,0.001380999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004624724,"threshold_uncertainty_score":0.01547122,"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."}}