Cargando...
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...
Guardado en:
| Publicado en: | Entropy (Basel) |
|---|---|
| Autores principales: | , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
MDPI
2019
|
| Materias: | |
| Acceso en línea: | 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 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|