Skip to main content

Advertisement

SpringerLink
Log in

Evolutional computations and neuronet and genetic algorithms — formal statements

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

We try to formalize the definition of some problems that deal with the application of evolutional and neuronet algorithms. One of our goals is to discuss the correctness of solutions obtained with the application of evolutional methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yu. V. Chekhovich, “Application of the algebraic approach in trend-separation problems,” in: Math. Methods of Pattern Recognition (MMRO-10). Proc. 10th Conf. of Russia CC RAS, ALEV-V, Moscow (2001), pp. 315–316.

  2. J. R. Filho, C. Alippi, and P. Treleaven, “Genetic-algorithm programming environments,” Computer, 27, No. 6, 28–43 (1994).

    Article  Google Scholar 

  3. S. Forrest, “Genetic algorithm: Principles of natural selection applied to computation,” Science, 261, 872–878 (1993).

    Article  Google Scholar 

  4. J. Holland, Adaptation in Natural and Artificial Systems, MIT Press, Cambridge (1992).

    Google Scholar 

  5. J. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge (1992).

    MATH  Google Scholar 

  6. J. Koza, Genetic Programming. II: Automatic Discovery of Reusable Programs, MIT Press, Cambridge (1994).

    MATH  Google Scholar 

  7. M. Minskiy and S. Pipert, Perceptrons [in Russian], Nauka, Moscow (1971).

    Google Scholar 

  8. S. Osovskiy, Neural Nets for Information Processing [in Russian], Finansy i Statistika, Moscow (2002).

    Google Scholar 

  9. F. Rosenblatt, Principles of Neurodynamics [in Russian], Nauka, Moscow (1965).

    MATH  Google Scholar 

  10. K. V. Rudakov and Yu. V. Chekhovich, “On the synthesis of learning algorithms for trend separation (algebraic approach),” in: Applied Mathematics and Informatics, Vol. 8, MSU VMiK Faculty Press, Moscow (2001), pp. 97–113.

    Google Scholar 

  11. M. Srinivas and L. Patnaik, “Genetic algorithms, A survey,” Computer, 27, No. 6, 17–26 (1994).

    Article  Google Scholar 

  12. J. Tou and R. Gonzalez, Pattern Recognition Principles [Russian translation], Mir, Moscow (1978).

    Google Scholar 

  13. Yu. I. Zhuravlev, “On recognition algorithms with representative sets (on logic algorithms),” Zh. Vychisl. Mat. Mat. Fiz., 42, No. 9, 1425–1435 (2002).

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    L. N. Korolev

Authors
  1. L. N. Korolev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 15, No. 3, pp. 119–133, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korolev, L.N. Evolutional computations and neuronet and genetic algorithms — formal statements. J Math Sci 168, 80–88 (2010). https://doi.org/10.1007/s10958-010-9976-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-010-9976-z

Keywords

Search

Navigation