|
Descripción
|
|
|---|---|
| Searching for new e?cient algorithms to solve complex optimization problems in big data scenarios is a priority, especially when the search space increases exponentially with the problem size, making impossible to ?nd a solution through a mere blind search. Networks of Evolutionary Processors (NEP) is a formal framework formed of highly parallel and distributed computing models inspired and abstracted from biological evolution that is able to solve hard problems in an e?cient way. However, NEP is not expressive enough to model quantitative aspects present in many problems. In this paper we propose NEPO, a new model based on the NEP evolutionary processors. NEPO deals with a class of data that is able to solve hard optimization problems and de?nes a novel selection process based on a quantitative ?ltering strategy. We present a linear time solution to a well known NP-complete optimization problem (the 0=1 Knapsack problem) in order to demonstrate NEPO advantages. This result suggests that NEPO's quantitative ?ltering is more suitable to tackle practical solutions to optimization problems in order to deploy them on highly scalable distributed computational platforms. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Journal of Computational Science |
|
ISSN
|
1877-7503 |
|
Factor de impacto JCR
|
1,567 |
|
Información de impacto
|
Datos JCR del año 2014 |
|
Volumen
|
16 |
|
DOI
|
http://dx.doi.org/10.1016/j.jocs.2016.05.008 |
|
Número de revista
|
|
|
Desde la página
|
65 |
|
Hasta la página
|
71 |
|
Mes
|
MAYO |
|
Ranking
|
SCI Imago = Q1 JCR Index = Q2 |