{"id":"W2168010321","doi":"10.1109/icec.1998.699505","title":"High-level synthesis of digital circuits using genetic algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; High-level synthesis; Scheduling (production processes); Integer programming; Latency (audio); Digital electronics; Genetic algorithm; Algorithm; Linear programming; Parallel computing; Processor scheduling; Electronic circuit; Mathematical optimization; Field-programmable gate array; Computer hardware; Mathematics; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.0001279947,0.0001373514,0.0002374103,0.0001523903,0.00004477301,0.0001346323,0.0008367681,0.00007547834,0.00004218993],"category_scores_gemma":[0.00006367567,0.000124995,0.00007150353,0.0003476653,0.00004653464,0.0005305283,0.0001577808,0.00005490296,0.0000516595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004653007,"about_ca_system_score_gemma":0.00001729455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006587214,"about_ca_topic_score_gemma":6.689579e-7,"domain_scores_codex":[0.9987085,0.00004744751,0.0003594651,0.0003158195,0.00033225,0.0002365585],"domain_scores_gemma":[0.9989229,0.0001171581,0.0001283992,0.0006647012,0.00009527039,0.0000715682],"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":[6.962478e-7,0.0002961805,0.00115459,0.000124099,0.00009255313,0.00008871647,0.0007460835,0.0002272554,0.0306813,0.02931987,0.002504437,0.9347642],"study_design_scores_gemma":[0.0002296751,0.0001546076,0.001237994,0.0002192821,0.00002319498,0.0002899365,0.00003710368,0.5138029,0.4746205,0.008473068,0.000172495,0.0007392931],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00929342,0.0001194372,0.9849727,0.00004380146,0.000118787,0.0001472385,0.000006276367,0.0003408891,0.004957425],"genre_scores_gemma":[0.7031538,0.000004081299,0.2965071,0.00001876716,0.00003061796,0.000007216854,7.770424e-8,0.000009961396,0.0002683641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9340249,"threshold_uncertainty_score":0.5097147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07623768902413831,"score_gpt":0.2537030904768477,"score_spread":0.1774654014527094,"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."}}