|
Descripción
|
|
|---|---|
| One of the greatest challenges of our time is to understand brain functions. Our goal is to study the existence of an optimal neuronal design, defined as the one that has a minimum total wiring. Many researchers have studied the problem of optimal wiring in neuronal trees. Here we propose a new approach. We start from point clouds formed by the branching points of real neuronal trees and we search for the optimal forest from these point clouds. To do this, we formalize the problem as a forest of degree constrained minimum spanning trees (DCMST). Since the DCMST problem is NP-hard, we will try to solve it using estimation of distribution algorithms, particularly in permutation domains. | |
|
Internacional
|
Si |
|
Nombre congreso
|
Genetic and evolutionary computation conference |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Amsterdam |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-1-4503-1964-5 |
|
DOI
|
|
|
Fecha inicio congreso
|
06/07/2013 |
|
Fecha fin congreso
|
10/07/2013 |
|
Desde la página
|
1647 |
|
Hasta la página
|
1650 |
|
Título de las actas
|
GECCO '13 Companion Proceedings of the 15th annual conference companion on Genetic and evolutionary computation |