activity
20012024
most citedComplexity and Philosophy

166 citations · 2.1k across the 99 of their papers we have counts for

collaborators
Showing cs.NEShow all

6 papers · 1 filter

cs.NE2022★ 6 cited

Temporal Heterogeneity Improves Speed and Convergence in Genetic Algorithms

Yoshio Martinez, Katya Rodriguez, Carlos Gershenson

Genetic algorithms have been used in recent decades to solve a broad variety of search problems. These algorithms simulate natural selection to explore a parameter space in search…

cs.NE2021

Artificial life: sustainable self-replicating systems

Carlos Gershenson, Jitka Cejkova

Nature has found one method of organizing living matter, but maybe other options exist -- not yet discovered -- on how to create life. To study the life "as it could be" is the obj…

cs.NE2012

Measuring the Complexity of Ultra-Large-Scale Adaptive Systems

Michele Amoretti, Carlos Gershenson

Ultra-large scale (ULS) systems are becoming pervasive. They are inherently complex, which makes their design and control a challenge for traditional methods. Here we propose the d…

cs.NE2010★ 20 cited

Computing Networks: A General Framework to Contrast Neural and Swarm Cognitions

Carlos Gershenson

This paper presents the Computing Networks (CNs) framework. CNs are used to generalize neural and swarm architectures. Artificial neural networks, ant colony optimization, particle…

cs.NE2003★ 162 cited

Artificial Neural Networks for Beginners

Carlos Gershenson

The scope of this teaching package is to make a brief induction to Artificial Neural Networks (ANNs) for people who have no previous knowledge of them. We first make a brief introd…

cs.NE2002★ 1 cited

Neural Net Model for Featured Word Extraction

A. Das, M. Marko, A. Probst +2

Search engines perform the task of retrieving information related to the user-supplied query words. This task has two parts; one is finding "featured words" which describe an artic…