{"id":"W2897904533","doi":"10.1109/cec.2018.8477823","title":"Discrete Firefly Algorithm: A New Metaheuristic Approach for Solving Constraint Satisfaction Problems","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Firefly algorithm; Constraint satisfaction problem; Metaheuristic; Constraint satisfaction; Mathematical optimization; Constraint (computer-aided design); Firefly protocol; Computer science; Algorithm; Hybrid algorithm (constraint satisfaction); Combinatorial optimization; Constraint satisfaction dual problem; Meta heuristic; Mathematics; Local consistency; Artificial intelligence; Particle swarm optimization","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.0002638374,0.0001736918,0.000177823,0.0001185147,0.0002693262,0.0002891635,0.0002390423,0.00007538698,0.0001714965],"category_scores_gemma":[0.00007159346,0.0001529725,0.00009199305,0.0002854942,0.0001122557,0.0006186164,0.00007395793,0.00008871554,0.00003082251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006028342,"about_ca_system_score_gemma":0.0001722733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001903217,"about_ca_topic_score_gemma":0.00007964442,"domain_scores_codex":[0.9986663,0.00002817326,0.0003102618,0.0004795517,0.0002119293,0.0003037744],"domain_scores_gemma":[0.9991342,0.00008326294,0.0001260142,0.0003283246,0.0001644707,0.0001637588],"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.000005253154,0.00002109159,0.0003354613,0.00001886106,0.00005124212,5.507871e-7,0.000697318,0.0009098703,0.0004780635,0.04231005,0.00244832,0.9527239],"study_design_scores_gemma":[0.0005825161,0.0001390024,0.001750475,0.00001137742,0.00001982256,0.00003894936,0.00007348527,0.9911271,0.0004944347,0.003834781,0.00167987,0.0002481648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007058383,0.00001977999,0.9917663,0.0005778964,0.0004309984,0.0006180197,0.000006314361,0.0003775273,0.00613252],"genre_scores_gemma":[0.2329245,0.000006641188,0.7657471,0.0002197029,0.0001825152,0.0000411648,0.00001255095,0.00001074296,0.000855087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9902173,"threshold_uncertainty_score":0.6238036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02425170404677029,"score_gpt":0.2585292115422395,"score_spread":0.2342775074954692,"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."}}