{"id":"W2908171364","doi":"10.1109/tcad.2018.2890532","title":"A Novel Heuristic Search Method for Two-Level Approximate Logic Synthesis","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Complement (music); Heuristic; Set (abstract data type); Computer science; Product (mathematics); Prime (order theory); Constraint (computer-aided design); State (computer science); Algorithm; Mathematical optimization; Mathematics; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004704527,0.0007297022,0.0008571449,0.001338208,0.0005314952,0.0007789929,0.0009597999,0.0007260726,0.00478732],"category_scores_gemma":[0.001415933,0.0004333559,0.0009120452,0.001055401,0.000512964,0.0008696408,0.0007763911,0.0007158707,0.000694107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000670239,"about_ca_system_score_gemma":0.001388204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002396853,"about_ca_topic_score_gemma":0.003070003,"domain_scores_codex":[0.9995447,0.00009473701,0.00002827717,0.00007825876,0.0001972663,0.00005675784],"domain_scores_gemma":[0.9996095,0.0001908244,0.00003272494,0.00006460614,0.00008346793,0.0000189016],"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.0002886221,0.0001411237,0.0006823239,0.0002963689,0.00008774713,0.0002065676,0.0001304225,0.418389,0.03351299,0.04441867,0.005154329,0.4966919],"study_design_scores_gemma":[0.00006839726,0.0000675749,0.00008097974,0.00001363522,0.00002170714,0.00009189054,0.00001573972,0.9832503,0.004269354,0.008672966,0.00343456,0.00001286733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006612062,0.0001833501,0.9902865,0.00005964862,0.00003180689,0.00006477557,0.00004676751,0.0005866202,0.002128564],"genre_scores_gemma":[0.137589,0.0001585368,0.8593562,0.0001133673,0.00003196418,0.0002326816,0.0002369972,0.0001402061,0.002141099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00478732,"threshold_uncertainty_score":0.01601517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05738437659770701,"score_gpt":0.2621432517209108,"score_spread":0.2047588751232038,"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."}}