Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
A series of evolutionary neural network simulations are presented which explore the hypothesis that learning factors can result in the evolution of long periods of parental protec...
A scalable architecture to facilitate emergent (self-organized) task decomposition using neural networks and evolutionary algorithms is presented. Various control system architectu...
Jekanthan Thangavelautham, Gabriele M. T. D'Eleute...
Abstract-- Genetic algorithms have been used to evolve several neural network architectures. In a previous effort, we introduced the evolution of three well known ART architects; F...
Assem Kaylani, Michael Georgiopoulos, Mansooreh Mo...