Chargement en cours...
An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems
Solving the constraint satisfaction problem (CSP) is to find an assignment of values to variables that satisfies a set of constraints. Ant colony optimization (ACO) is an efficient algorithm for solving CSPs. However, the existing ACO-based algorithms suffer from the constructed assignment with high...
Enregistré dans:
| Publié dans: | Entropy (Basel) |
|---|---|
| Auteurs principaux: | , , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
MDPI
2019
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7515295/ https://ncbi.nlm.nih.gov/pubmed/33267479 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e21080766 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|