{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008846826,0.001060034,0.001363841,0.0007170509,0.0005630248,0.0007354813,0.001196164,0.001065048,0.002189915],"category_scores_gemma":[0.001768127,0.000452585,0.0006919849,0.0009199068,0.0006044138,0.0006825501,0.001008037,0.00154408,0.0003614793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007453894,"about_ca_system_score_gemma":0.001490813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006373972,"about_ca_topic_score_gemma":0.005226481,"domain_scores_codex":[0.9995826,0.0001337148,0.00002371645,0.00007179297,0.0001426128,0.00004558945],"domain_scores_gemma":[0.9994264,0.0003611377,0.00005443152,0.00003718023,0.00009266225,0.00002818672],"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.00005466674,0.00005354823,0.0003156224,0.00006952214,0.00004202904,0.00006185586,0.00005806135,0.9405469,0.001331981,0.01049799,0.002097307,0.04487049],"study_design_scores_gemma":[0.00001299611,0.00001180778,0.0000289075,0.000002780892,0.000002868882,0.000007186182,0.000005031656,0.9977661,0.0001778059,0.001457471,0.0005245596,0.000002465708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003845114,0.000134812,0.9937001,0.0001136546,0.00004022495,0.00006109614,0.00003233791,0.0002293929,0.001843127],"genre_scores_gemma":[0.200008,0.0002719844,0.7952631,0.0001563859,0.00006070629,0.0005693147,0.0002872741,0.00009866014,0.003284661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006373972,"threshold_uncertainty_score":0.01267374,"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."}}