{"id":"W2118597757","doi":"10.1109/icvd.1997.567960","title":"An enhanced genetic solution for scheduling, module allocation, and binding in VLSI design","year":2002,"lang":"en","type":"article","venue":"","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scheduling (production processes); Very-large-scale integration; Processor scheduling; Job shop scheduling; Parallel computing; Interdependence; High-level synthesis; Genetic algorithm; Distributed computing; Mathematical optimization; Simple (philosophy); Theoretical computer science; Embedded system; Mathematics; Field-programmable gate array; Computer network; Machine learning","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.0005073785,0.0004932297,0.0003669544,0.0003930357,0.0002822517,0.0003287757,0.0008032052,0.0007452271,0.001143648],"category_scores_gemma":[0.0008905215,0.0002338425,0.0004158975,0.0003978228,0.0005483464,0.0003886829,0.0004060004,0.0006078766,0.0001988188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000421107,"about_ca_system_score_gemma":0.0007862497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001604841,"about_ca_topic_score_gemma":0.002120242,"domain_scores_codex":[0.9997559,0.00007976344,0.000006231371,0.00003290729,0.00009528634,0.000029911],"domain_scores_gemma":[0.9998677,0.00007077442,0.00001611273,0.00001473396,0.00002496807,0.000005790043],"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.00003526911,0.00005189159,0.0002931499,0.00009227195,0.00003167683,0.00009437737,0.00008205617,0.8300238,0.01452822,0.04559596,0.0009312395,0.1082401],"study_design_scores_gemma":[0.00002780771,0.00006807686,0.0001182554,0.0000142848,0.00002016884,0.00006154567,0.00001305569,0.9820145,0.003573457,0.009967875,0.004115038,0.00000584698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01559138,0.0001564864,0.9815886,0.00008510427,0.00002538309,0.00003760146,0.00001054139,0.0001237188,0.002381282],"genre_scores_gemma":[0.1756623,0.0002919702,0.8204626,0.0001029528,0.00002377856,0.0001237729,0.00004594054,0.00004617492,0.003240534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001604841,"threshold_uncertainty_score":0.003825843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0463678654497514,"score_gpt":0.2781411350269936,"score_spread":0.2317732695772421,"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."}}