{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807685,0.00009976475,0.000114976,0.0001772678,0.00007902873,0.0001179786,0.0003462865,0.00007547041,0.000005726651],"category_scores_gemma":[0.00003934044,0.0001002655,0.00001624933,0.0002358483,0.00002029909,0.0005347034,0.00003515976,0.00004767589,0.000008360681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005748748,"about_ca_system_score_gemma":0.00001472487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003149472,"about_ca_topic_score_gemma":0.00002248327,"domain_scores_codex":[0.9989595,0.0001033867,0.0002381723,0.000363049,0.0001147912,0.0002211031],"domain_scores_gemma":[0.9993876,0.0000667712,0.00006562558,0.0003499764,0.00007150544,0.00005847285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006004031,0.0001730009,0.0004398725,0.00006573644,0.00001077787,0.000002751033,0.002853775,0.003085495,0.8469489,0.02876631,0.0009381966,0.1167092],"study_design_scores_gemma":[0.0001741906,0.0001368657,0.0001661431,0.00002167672,0.000001279791,0.000004553599,0.00001236274,0.8405985,0.1562256,0.002519031,0.00001882236,0.0001210614],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03072579,0.0001166387,0.967944,0.000128124,0.00005082518,0.0005855972,2.652407e-7,0.000289605,0.0001591888],"genre_scores_gemma":[0.5171627,0.00001260611,0.4826045,0.00003403494,0.00001463318,0.00008831655,4.294643e-7,0.000005316055,0.00007752407],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.837513,"threshold_uncertainty_score":0.4088709,"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."}}