Skip to main content
SpringerLink
Log in

Parallel Boltzmann Machine Topologies for Simulated Annealing Realisation of Combinatorial Problems

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

  • 178 Accesses

Abstract

In this paper we investigate the convergence of parallel Boltzmann Machine topologies for solving the maximum matching problem. The simulations of the Boltzmann Machine topologies are done in Occam on transputers. The results of tests carried out by varying some implementation parameters are presented. A description is given of a Boltzmann Machine in terms of an asynchronous iterative algorithm allowing a new approach to the proof of theoretical convergence.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E. and Korst, J. “Simulated Annealing andBoltzmann Machines” John Wiley and Sons, 1989

    Google Scholar 

  2. Aarts, E. and Korst, J. “Boltzmann Machines as a Model for Parallel Annealing” Algorithmica, Springer Verlag, 1991, No. 6, pp. 437–465.

    MathSciNet  MATH  Google Scholar 

  3. Baudet, G. M. “Asynchronous Iterative Methods for Multiprocessors” 1. ACM 25, 2 (APR 78 ), pp. 226–244.

    Google Scholar 

  4. Chazan, D. and Miranker, W. “Chaotic Relaxation” Linear Algebra and its Applications, 1969, pp. 199–22.

    Google Scholar 

  5. Lovasz, L. and Plummer, M. D. “Matching Theory” Elsevier Science, 1986.

    Google Scholar 

  6. Uresin, A. and Dubois, M. “Parallel Asynchronous Algorithms for Discrete Data” J. ACM 37, (July 90 ), pp. 588–606.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electronic Engineering, University of Surrey, England

    I. Ashman, T. Vladimirova, C. Jesshope & R. Peel

Authors
  1. I. Ashman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Vladimirova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Jesshope
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. Peel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Ashman, I., Vladimirova, T., Jesshope, C., Peel, R. (1995). Parallel Boltzmann Machine Topologies for Simulated Annealing Realisation of Combinatorial Problems. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7535-4_78

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82692-8

  • Online ISBN: 978-3-7091-7535-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation