{"id":"W2025187426","doi":"10.1142/s1469026801000044","title":"AN ENHANCED GENETIC ALGORITHM FOR SOLVING THE HIGH-LEVEL SYNTHESIS PROBLEMS OF SCHEDULING, ALLOCATION, AND BINDING","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Crossover; Scheduling (production processes); High-level synthesis; Job shop scheduling; Mathematical optimization; Parallel computing; Theoretical computer science; Algorithm; Field-programmable gate array; Routing (electronic design automation); Mathematics","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.0005789332,0.0001091683,0.0001607823,0.0002289527,0.000140291,0.0001701904,0.000897087,0.00004586618,0.00000365079],"category_scores_gemma":[0.00007061625,0.00008844619,0.00005328952,0.0002082866,0.0001187368,0.0004651481,0.00006492007,0.00009508737,0.000001137388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003578343,"about_ca_system_score_gemma":0.0001059755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002075484,"about_ca_topic_score_gemma":0.000003421668,"domain_scores_codex":[0.9986028,0.00004354746,0.0006534044,0.0001994296,0.0003934086,0.000107411],"domain_scores_gemma":[0.9969591,0.0007668887,0.0005945617,0.0001582631,0.001455357,0.00006575404],"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.000008731447,0.000144288,0.0001631225,0.00002090916,0.0001307892,0.000001419991,0.0007490546,0.0678735,0.004987844,0.1435743,0.00003050466,0.7823156],"study_design_scores_gemma":[0.0001764868,0.0001985046,0.001602334,0.0002344433,0.00003579549,0.0004048176,0.000345066,0.675431,0.03971076,0.2810492,0.0005934594,0.0002181142],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01169896,0.0002869113,0.9866822,0.0008479324,0.00009021596,0.0003360016,0.00001743345,0.00002156185,0.00001880442],"genre_scores_gemma":[0.5885329,0.0002064411,0.4109895,0.00005146652,0.0001178358,0.00008639454,0.000003690456,0.000005529064,0.000006305049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7820974,"threshold_uncertainty_score":0.3606731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03936328554736702,"score_gpt":0.3216497545698783,"score_spread":0.2822864690225113,"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."}}