{"id":"W2808950187","doi":"10.1142/s1469026818500104","title":"A Strength Pareto Evolutionary Algorithm for Optimizing System-On-Chip Test Schedules","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Pareto principle; Evolutionary algorithm; System on a chip; Chip; Pareto optimal; Scheduling (production processes); Embedded system; Parallel computing; Multi-objective optimization; Mathematical optimization; Artificial intelligence; 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.0002993454,0.0001388113,0.0001614075,0.0002820945,0.000272326,0.0002122312,0.0008732826,0.00004670701,0.000005345986],"category_scores_gemma":[0.0001311139,0.0001291333,0.000103424,0.0002351445,0.0001347532,0.0004118784,0.00008625209,0.0001371377,0.00002383802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009438257,"about_ca_system_score_gemma":0.000177988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003727293,"about_ca_topic_score_gemma":8.508183e-7,"domain_scores_codex":[0.9985194,0.00002436462,0.000562862,0.000255697,0.0004741634,0.0001635768],"domain_scores_gemma":[0.9965138,0.001092583,0.0004098054,0.0001336919,0.00173337,0.0001167876],"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.000002593694,0.0001777116,0.0002464786,0.00001001658,0.00008179376,0.000006142691,0.0001413273,0.01361929,0.00004843869,0.3702066,0.0001866624,0.6152729],"study_design_scores_gemma":[0.0002616851,0.0003679535,0.0009736349,0.0002299011,0.00001885574,0.0004397432,0.0003811954,0.9033441,0.0007817165,0.08981027,0.003182219,0.0002087543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001179322,0.0001840262,0.996749,0.0008242757,0.0003140038,0.0001725015,0.00004655191,0.0000498741,0.0004803917],"genre_scores_gemma":[0.7209122,0.00002230563,0.2777213,0.0002403261,0.001030935,0.00003707328,0.00001367208,0.000007901956,0.00001438078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8897248,"threshold_uncertainty_score":0.5265902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03092966379209095,"score_gpt":0.3078852919468777,"score_spread":0.2769556281547867,"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."}}