skip to main content
10.1145/1141277.1141502acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

A-Brain: the multiple problems solver

Published:23 April 2006Publication History

ABSTRACT

Intelligence is strongly related to the ability of solving different problems by a single system. General problems solvers such as Artificial Neural Networks, Evolutionary Algorithms, Particle Swarm etc, have traditionally been tested against one problem at one time. The purpose of this research is to build a complex and adaptive system able to solve multiple (and different) problems. The proposed system, called A-Brain, consists of several connected components (a Decision Maker, a Trainer and several Problem Solvers) which provide a base for building complex problem solvers. The A-Brain system is applied for solving some well-known problems in the field of symbolic regression. Numerical experiments show that A-Brain system is able to perform very well on the considered test problems.

References

  1. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to NP-Completeness, Freeman & Co, San Francisco, CA, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. de Garis, H., Korkin, M., The CAM-BRAIN Machine (CBM): An FPGA Based Hardware Tool which Evolves a 1000 Neuron Net Circuit Module in Seconds and Updates a 75 Million Neuron Artificial Brain for Real Time Robot Control, Neurocomputing journal, Elsevier, Vol. 42 (1--4), 2002.Google ScholarGoogle Scholar
  3. Haykin, S., Neural Networks, a Comprehensive Foundation, second edition, Prentice-Hall, Englewood Cliffs, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Koza, J. R., Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge, MA, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Oltean, M., Groşan, C., A Comparison of Several Linear Genetic Programming Techniques, Complex-Systems, Vol. 14(4), pp. 282--311, 2003.Google ScholarGoogle Scholar
  6. Oltean M., Groşan C., Evolving Digital Circuits using Multi Expression Programming, NASA/DoD Conference on Evolvable Hardware, Zebulum, R., (et al.) (editors), pp. 87--90, IEEE Press, NJ, 2004.Google ScholarGoogle Scholar
  7. Oltean, M., Dumitrescu, D., Evolving TSP Heuristics using Multi Expression Programming, ICCS'04, Bubak, M., (et al.) (editors), LNCS 3037, pp. 670--673, Springer-Verlag, 2004.Google ScholarGoogle Scholar
  8. Oltean, M., Improving Multi Expression Programming: an Ascending Trail from Sea-level Even-3-parity Problem to Alpine Even-18-Parity Problem, Evolvable Machines: Theory and Applications, Springer Verlag, Nedjah, N., (et al.) (editors), pp. 229--255, 2005.Google ScholarGoogle Scholar
  9. Oltean, M., Evolving Evolutionary Algorithms using Linear Genetic Programming, Evolutionary Computation, MIT Press, MA, USA, Vol. 13, pp. 387 -- 410, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Poli R., Page J., Solving high-order Boolean parity problems with smooth uniform crossover, sub-machine-code GP and demes, Genetic Programming and Evolvable Machines, Vol. 1, pp. 37--56, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Prechelt, L., PROBEN1 - A Set of Neural Network Problems and Benchmarking Rules, Technical Report 21, University of Karlsruhe, 1994.Google ScholarGoogle Scholar
  12. Wolpert, D. H., McReady, W. G., No Free Lunch Theorems for Search, technical report SFI-TR-05-010, Santa Fe Institute, 1995.Google ScholarGoogle Scholar

Index Terms

  1. A-Brain: the multiple problems solver

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '06: Proceedings of the 2006 ACM symposium on Applied computing
      April 2006
      1967 pages
      ISBN:1595931082
      DOI:10.1145/1141277

      Copyright © 2006 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 23 April 2006

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate1,650of6,669submissions,25%
    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader