{"id":"W2967642867","doi":"10.1109/cec.2019.8789903","title":"Self-Adaptive Discrete Firefly Algorithm for Minimal Perturbation in Dynamic Constraint Satisfaction Problems","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; Constraint satisfaction; Computer science; Constraint logic programming; Algorithm; Scheduling (production processes); Dynamic priority scheduling; 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.00141743,0.0008590008,0.001389488,0.0007225809,0.0005277628,0.000654629,0.001558514,0.001175315,0.001416813],"category_scores_gemma":[0.002080237,0.0003811162,0.0007969877,0.0007204562,0.0006422719,0.0008504872,0.0009174158,0.001306325,0.0002089502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009707078,"about_ca_system_score_gemma":0.00144237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004486557,"about_ca_topic_score_gemma":0.004003296,"domain_scores_codex":[0.9994715,0.000182736,0.00002415346,0.00008177043,0.0001516439,0.0000881757],"domain_scores_gemma":[0.9993213,0.0004362269,0.00006875757,0.00004071246,0.0000791265,0.00005387151],"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.0001125342,0.0001016517,0.0005487838,0.00007883364,0.00006030756,0.00006430349,0.00009243318,0.9427868,0.003954283,0.008667543,0.001437169,0.04209539],"study_design_scores_gemma":[0.00002186464,0.00002199615,0.00004411289,0.000003679313,0.000004557971,0.0000108627,0.00000660969,0.9980361,0.0003882029,0.001131683,0.0003268457,0.000003522241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02564457,0.0003198229,0.9709697,0.0002532653,0.00006036849,0.00009608497,0.00004191793,0.0003592839,0.002255027],"genre_scores_gemma":[0.3524256,0.0002944022,0.6439841,0.000238423,0.0000560336,0.0003463913,0.0001780199,0.0001301194,0.002346929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004486557,"threshold_uncertainty_score":0.008920908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008030081502091758,"score_gpt":0.2306136238375643,"score_spread":0.2225835423354726,"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."}}