Cargando…
People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours
Humans need to solve computationally intractable problems such as visual search, categorization, and simultaneous learning and acting, yet an increasing body of evidence suggests that their solutions to instantiations of these problems are near optimal. Computational complexity advances an explanati...
| Autores principales: | , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2010
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2912227/ https://www.ncbi.nlm.nih.gov/pubmed/20686597 http://dx.doi.org/10.1371/journal.pone.0011685 |