{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001057963,0.0004765633,0.0008623435,0.0005491485,0.0001324699,0.0001422055,0.0003449667,0.0002327633,0.00002662512],"category_scores_gemma":[0.000009783268,0.0004079399,0.0001669387,0.0005205456,0.00005608652,0.0002213751,0.000001927245,0.000381665,0.00003652591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001712304,"about_ca_system_score_gemma":0.00009769188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001630874,"about_ca_topic_score_gemma":0.00000324682,"domain_scores_codex":[0.9975816,0.0002096489,0.0007835415,0.0005333305,0.0003514256,0.0005404422],"domain_scores_gemma":[0.9975535,0.001367908,0.0001129364,0.0004947499,0.0003091374,0.0001617713],"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.00005740847,0.0001381587,0.000003102395,0.0008259246,0.0003231268,0.000003275889,0.0002625088,0.8179842,0.1474604,0.0004399809,0.0001036213,0.03239822],"study_design_scores_gemma":[0.001168505,0.0004653092,0.00001093014,0.0005576881,0.00009347074,0.00009889538,0.0001355768,0.9191825,0.0777969,0.0000306357,0.00004109566,0.0004184721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00648377,0.0001596103,0.9888216,0.000009985686,0.001845683,0.001876566,0.0003161079,0.0003634332,0.0001232177],"genre_scores_gemma":[0.9240429,0.00004253286,0.07523301,0.00002265098,0.00006905157,0.000326151,0.000006790701,0.0001040516,0.0001528631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9175591,"threshold_uncertainty_score":0.9998372,"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."}}