{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002142862,0.0001544611,0.0001627419,0.0001766103,0.0000669806,0.000115491,0.0001478696,0.00009469867,0.0000977526],"category_scores_gemma":[0.00001375835,0.0001454113,0.00006704125,0.0002646171,0.00002652514,0.0008120841,0.00004262685,0.0001080549,0.00004847649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002184516,"about_ca_system_score_gemma":0.0001136276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005541564,"about_ca_topic_score_gemma":0.000238137,"domain_scores_codex":[0.9987839,0.00004705469,0.000308431,0.0004313682,0.0001874733,0.0002417993],"domain_scores_gemma":[0.9993805,0.0001233762,0.000118303,0.0002156196,0.0001028469,0.00005930736],"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.00001412802,0.00005351521,0.003645039,0.00003402797,0.00003179625,0.000001440426,0.001530591,0.002636449,0.0004090602,0.04447523,0.00004836469,0.9471204],"study_design_scores_gemma":[0.0008788914,0.0001726143,0.02267157,0.0000198955,0.000004194671,0.00001332596,0.000200705,0.9736696,0.00007509186,0.001810513,0.0002824409,0.0002011354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006799317,0.00001406805,0.9880106,0.0007410963,0.0004036044,0.001137402,0.00001111483,0.0002462678,0.002636527],"genre_scores_gemma":[0.5455369,0.00001226367,0.4538172,0.0001164446,0.00001027105,0.00006207381,0.00001481641,0.000007872947,0.0004221691],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9710332,"threshold_uncertainty_score":0.5929699,"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."}}