{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704792,0.0009633147,0.0007870507,0.001237496,0.0004412218,0.0004983824,0.0009904183,0.001003537,0.00221829],"category_scores_gemma":[0.003824735,0.0004488212,0.0007006684,0.0008322206,0.0006440915,0.0004973232,0.0007532756,0.0007866327,0.0003189353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009802833,"about_ca_system_score_gemma":0.001416758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002611956,"about_ca_topic_score_gemma":0.002100274,"domain_scores_codex":[0.9995384,0.0001940425,0.00001698621,0.00004496378,0.0001471662,0.00005837682],"domain_scores_gemma":[0.9987609,0.0008260953,0.00007556706,0.00005067472,0.0002248837,0.00006180039],"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.00002846896,0.00003848912,0.0004481054,0.00002267584,0.00002977535,0.00003105942,0.00002685452,0.954221,0.0009464672,0.005982559,0.0005854312,0.03763927],"study_design_scores_gemma":[0.00001122888,0.00002785931,0.000074983,0.000003784072,0.000005571761,0.0000066783,0.00000496399,0.9974607,0.00016389,0.001927547,0.0003106635,0.000002059088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0465505,0.0002752294,0.9458425,0.0002072943,0.00004551968,0.0001338743,0.00005303934,0.0002658226,0.006626271],"genre_scores_gemma":[0.4952004,0.0002845283,0.4968866,0.0002551429,0.00004324075,0.000553881,0.0002285597,0.0001420625,0.006405526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002611956,"threshold_uncertainty_score":0,"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."}}