{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007546915,0.0007323292,0.0009896137,0.001019419,0.0004978008,0.0007789588,0.001519954,0.001133065,0.001523614],"category_scores_gemma":[0.001021962,0.0003315693,0.0011366,0.001135548,0.0005682936,0.0009339819,0.000625395,0.001520228,0.0003344233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008827329,"about_ca_system_score_gemma":0.001250634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00300597,"about_ca_topic_score_gemma":0.002920338,"domain_scores_codex":[0.9996001,0.0001051467,0.00002240666,0.00005103909,0.0001821034,0.00003919533],"domain_scores_gemma":[0.9997138,0.0001475335,0.00003865817,0.00002761207,0.00005179032,0.00002057603],"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.0001315245,0.0002223143,0.0009569373,0.0004526843,0.0002213635,0.0001803321,0.0001609561,0.654439,0.02231538,0.05764714,0.007868703,0.2554037],"study_design_scores_gemma":[0.00007483723,0.00007545534,0.0001625728,0.00002178958,0.00002406661,0.00009261528,0.00001557818,0.977832,0.003893089,0.008644013,0.009145862,0.00001818711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005560295,0.000663409,0.99054,0.000226616,0.00007716171,0.00007051948,0.00006928535,0.000305271,0.002487417],"genre_scores_gemma":[0.1093184,0.001256174,0.8841732,0.0002776225,0.00009140353,0.0002540055,0.0002405557,0.0001236645,0.004265056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00300597,"threshold_uncertainty_score":0.006404698,"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."}}