Networks of evolutionary processors: UML architecture

Authors:
Miguel Anel Peña;Miguel Angel Diaz;Nuria Gomez Blas
Affiliations:
Escuela de Informática, Dept. OEI, UPM, Madrid, Spain;Escuela de Informática, Dept. OEI, UPM, Madrid, Spain;Escuela de Informática, Dept. OEI, UPM, Madrid, Spain
Venue:
CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
Year:
2006

Citing 6
Cited 0

The connection machine

The connection machine
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Computing with membranes

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction

Membrane Computing: An Introduction
All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size

DNA'06 Proceedings of the 12th international conference on DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a connectionist model that is widely used to solve NP-problems: Networks of Evolutionary Processors (NEP). A NEP is a set of processors connected by a graph, each processor only deals with symbolic information using rules, that is, symbols in a processor evolve according some rules. Communication through the graph is based on a filter set that permits (or not) symbols to go from one processor to another. This two steps: evolution and communication, makes NEPs able to solve NP-problems. This paper also proposes an UML architecture to implement NEPs. This work is actually under development and will be implemented in a distributed way, maybe using Java Agent Development Enviroment - JADE, in order to obtain similar results to theoretical ones: solution of NP-problems in linear time. Proposed UML architecture is based on the general behaviour of NEPs.