Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication

Starting from the fact that complete Accepting Hybrid Networks of Evolutionary Processors allow much communication between the nodes and are far from network structures used in practice, we propose in this paper three network topologies that restrict the communication: star networks, ring networks, and grid networks. We show that ring-AHNEPs can simulate 2-tag systems, thus we deduce the existence of a universal ring-AHNEP. For star networks or grid networks, we show a more general result; that is, each recursively enumerable language can be accepted efficiently by a star- or grid-AHNEP. We also present bounds for the size of these star and grid networks. As a consequence we get that each recursively enumerable can be accepted by networks with at most 13 communication channels and by networks where each node communicates with at most three other nodes.Comment: In Proceedings DCFS 2010, arXiv:1008.127

A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors

We consider three complexity classes defined on Accepting Hybrid Networks of Evolutionary Processors (AHNEP) and compare them with the classical complexity classes defined on the standard computing model of Turing machine. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the family of languages decided by AHNEPs in polynomial time. A language is in P if and only if it is decided by an AHNEP in polynomial time and space. We also show that PSPACE equals the family of languages decided by AHNEPs in polynomial length

Implementation of a NEP in Java

TheNetworks of Evolutionary Processors (NEPs) are computing mechanisms directly inspired from the behavior of cell populations more specifically the point mutations in DNA strands.These mechanisms are been used for solving NP-complete problems by means of a parallel computation postulation.This paper describes an implementation of the basic model of NEP and includes the possibility of designing some of the most common variants of it by means of a graphic user interface which eases the configuration of a given problem. It is a system designed to be used in a multicore processor in order to benefit from the multi thread use

A Web Implementation of A Generalized NEP

The Networks of Evolutionary Processors (NEPs) are computing mechanisms directly inspired from the behavior of cell populations more specifically the point mutations in DNA strands. These mechanisms are been used for solving NP-complete problems by means of a parallel computation postulation. This paper describes an implementation of the basic model of NEP using Web technologies and includes the possibility of designing some of the most common variants of it by means the use of the web page design which eases the configuration of a given problem. It is a system intended to be used in a multicore processor in order to benefit from the multi thread use

Efficient local search for Pseudo Boolean Optimization

Algorithms and the Foundations of Software technolog

Real life applications of bio-inspired computing models: EAP and NEPs

Tesis doctoral inédita leída en la Universidad Autónoma de Madrid, Escuela Politécnica Superior, Departamento de Ingeniería Informática. Fecha de lectura: 04-07-201