{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063214,0.0009369535,0.0007269193,0.0007159847,0.0004867325,0.0005793643,0.001240496,0.001172727,0.001658292],"category_scores_gemma":[0.001836529,0.000385234,0.000971952,0.0006607717,0.0006735669,0.0007173824,0.0006544375,0.001336866,0.0003616672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007257319,"about_ca_system_score_gemma":0.001468284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003192654,"about_ca_topic_score_gemma":0.004201964,"domain_scores_codex":[0.9994517,0.0001644813,0.00002250185,0.00009481767,0.0002104842,0.00005600462],"domain_scores_gemma":[0.9994993,0.0002983208,0.00004290192,0.00005261368,0.00008727003,0.00001959298],"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.00006771742,0.0001155194,0.0007291638,0.0001278072,0.000088045,0.0001252825,0.0001119817,0.7758942,0.01113593,0.02978925,0.001403616,0.1804115],"study_design_scores_gemma":[0.00004203878,0.00006050075,0.0001419633,0.00001488517,0.00003518425,0.0000746181,0.00001166148,0.9870645,0.00219139,0.006952094,0.003402123,0.000009035186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006879928,0.0001186399,0.9911572,0.00006328727,0.00002692029,0.0000501027,0.00001323315,0.0002427931,0.001447944],"genre_scores_gemma":[0.06891584,0.0001755357,0.9290591,0.0000826568,0.00002620376,0.0001785266,0.00006894745,0.000059583,0.00143355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003192654,"threshold_uncertainty_score":0.006348133,"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."}}