Solving NP-Complete Problems with Networks of Evolutionary Processors (original) (raw)

Abstract

We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NP-complete problem is solved by networks of evolutionary processors of linear size in linear time. Some further directions of research are finally discussed.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. P. Banâtre, A. Coutant, D. Le Metayer, A parallel machine for multiset transformation and its programming style, Future Generation Computer Systems, 4 (1988), 133–144.
    Article Google Scholar
  2. R. Constable, H. Hunt, S. Sahni, On the computational complexity of scheme equivalence, Technical Report No. 74-201, Dept. of Computer Science, Cornell University, Ithaca, NY, 1974.
    Google Scholar
  3. E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Paun-Grammar Systems, Gordon and Breach, 1993.
    Google Scholar
  4. E. Csuhaj-Varjú, Networks of parallel language processors. In New Trends in Formal Languages (Gh. Păun, A. Salomaa, eds.), LNCS 1218, Springer Verlag, 1997, 299–318
    Google Scholar
  5. L. Errico, C. Jesshope, Towards a new architecture for symbolic processing. In Artificial Intelligence and Information-Control Systems of Robots’ 94 (I. Plander, ed.), World Sci. Publ., Singapore, 1994, 31–40.
    Google Scholar
  6. S. E. Fahlman, G. E. Hinton, T. J. Seijnowski, Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. In Proc. AAAI National Conf. on AI, William Kaufman, Los Altos, 1983, 109–113.
    Google Scholar
  7. M. Garey, D. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
    Google Scholar
  8. W. D. Hillis, The Connection Machine, MIT Press, Cambridge, 1985.
    Google Scholar
  9. J. Hopcroft, J. Ulmann, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, MA, 1969.
    MATH Google Scholar
  10. L. Kari, G. Gloor, S. Yu, Using DNA to solve the Bounded Correspondence Problem, Theoret. Comput. Sci., 231 (2000), 193–203.
    Article MATH MathSciNet Google Scholar
  11. Gh. Păun, Computing with membranes, J. Comput. Syst. Sci. 61(2000). (see also TUCS Research Report No. 208, November 1998, http://www.tucs.fi.)
  12. Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Dept. Inteligencia Artificial - Facultad de Informática, Universidad de Madrid - Campus de Montegancedo, Boadilla del Monte, 28660, Madrid, Spain
    Juan Castellanos
  2. Research Group in Mathematical Linguistics, Rovira i Virgili University, pça. Imperial Tàrraco 1, 43005, Tarragona, Spain
    Carlos Martín-Vide
  3. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania
    Victor Mitrana
  4. Department of Information Systema and Computation, Polytechnical University of Valencia, Valencia, 46071, Spain
    Jose M. Sempere

Authors

  1. Juan Castellanos
  2. Carlos Martín-Vide
  3. Victor Mitrana
  4. Jose M. Sempere

Editor information

Editors and Affiliations

  1. Departamento de Inteligencia Artificial Sanda del Rey, Universidad Nacional de Educación a Distancia, s/n., Madrid, 28040, Spain
    José Mira
  2. Departamento de Arquitectura y Tecnología de Computadores, Universidad de Granada, Campus Fuentenueva, 18071, Granada, Spain
    Alberto Prieto

Rights and permissions

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.M. (2001). Solving NP-Complete Problems with Networks of Evolutionary Processors. In: Mira, J., Prieto, A. (eds) Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence. IWANN 2001. Lecture Notes in Computer Science, vol 2084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45720-8\_74

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us