{"id":"W2991311469","doi":"10.1109/smc.2019.8914496","title":"Discrete Particle Swarm Optimization Algorithm for Dynamic Constraint Satisfaction with Minimal Perturbation","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Mathematical optimization; Computer science; Constraint satisfaction; Particle swarm optimization; Algorithm; Constraint logic programming; Local consistency; Scheduling (production processes); Constraint programming; Mathematics; Artificial intelligence","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.0001464923,0.0001516867,0.0001394831,0.0000791389,0.0001236612,0.0001940072,0.0001262625,0.00006641242,0.0002226398],"category_scores_gemma":[0.00001635317,0.0001274404,0.00005257943,0.0002575945,0.00004539777,0.0009660464,0.00002907938,0.00006727585,0.00003543676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009778616,"about_ca_system_score_gemma":0.00008942339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002207275,"about_ca_topic_score_gemma":0.00005565413,"domain_scores_codex":[0.9988682,0.00003489374,0.0002399363,0.0004027667,0.0002215265,0.000232629],"domain_scores_gemma":[0.9992533,0.00009452753,0.0001231524,0.0002713371,0.0001739174,0.00008375759],"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.00004498979,0.00004494742,0.00611644,0.00002215898,0.00005050359,0.000001371533,0.0004474357,0.3674145,0.0006758012,0.03729584,0.00006137786,0.5878246],"study_design_scores_gemma":[0.001040514,0.0002353035,0.006107176,0.00001258907,0.00001125464,0.00002413032,0.0001603258,0.9913062,0.000602878,0.0002136125,0.00007698215,0.0002089675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01212132,0.000007816097,0.984761,0.0009370352,0.000277423,0.0007407306,0.000009125101,0.0002678387,0.0008777135],"genre_scores_gemma":[0.5091187,0.000006432813,0.4900346,0.0001391391,0.00001306129,0.00003688872,0.00002696667,0.000009445549,0.0006147142],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6238917,"threshold_uncertainty_score":0.5196871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006169122267158296,"score_gpt":0.2247085650377693,"score_spread":0.218539442770611,"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."}}