Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the size complexity of universal accepting hybrid networks of evolutionary processors
Mathematical Structures in Computer Science
Networks of evolutionary processors with a self-organizing learning
AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
Theory of Computing Systems
Hybrid networks of evolutionary processors
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Accepting hybrid networks of evolutionary processors
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 0.07 |
In this paper, we consider a new variant of networks of evolutionary processors which seems to be more suitable for a software and hardware implementation. Each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined, the data polarization is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. This new variant is investigated here as a problem solver. We propose solutions based on networks of polarized evolutionary processors to two computationally hard problems, namely the ''3-colorability problem'', and a more general one known as the ''Common Algorithmic Problem''. Our solutions are uniform (they work for all instances of the same size) and time efficient (they work in linear time).