Skip to main content

An Algorithm for Discovery of New Families of Optimal Regular Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2843))

Abstract

This work describes a new algorithm for discovery of analytical descriptions of new dense families of optimal regular networks using evolutionary computation. We present the new families of the networks of degree 3 and 6 obtained by the discovery algorithm which improve previously known results.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arden, B.W., Lee, H.: Analysis of chordal ring networks. IEEE Trans. Computers C-30, 291–295 (1981)

    Article  MathSciNet  Google Scholar 

  2. Balaban, A.T.: Reaction graphs. In: Bonchev, D., Mekenyan, O. (eds.) Graph Theoretical Approaches to Chemical Reactivity, pp. 137–180. Kluwer Academic Publishers, Netherlands (1994)

    Google Scholar 

  3. Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: a survey. J. Parallel Distributed Comput. 24, 2–10 (1995)

    Article  Google Scholar 

  4. Bermond, J.-C., Illiades, G., Peyrat, C.: An optimization problem in distributed loop computer networks. In: Proc. of Third International Conference on Combinatorial Math., New York, USA, June 1985, vol. 555, pp. 45–55. Ann. New York Acad. Sci. (1985)

    Google Scholar 

  5. Boesch, F.T., Wang, J.-F.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuits Syst. CAS-32, 1286–1291 (1985)

    Article  MathSciNet  Google Scholar 

  6. Chen, S., Jia, X.-D.: Undirected loop networks. Networks 23, 257–260 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway (1995)

    Google Scholar 

  8. Koza, J.: Genetic Programming. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  9. Kwai, D.-M., Parhami, B.: Tight Bounds on the Diameter of Gaussian Cubes. The Computer Journal 41(1), 52–56 (1998)

    Article  MATH  Google Scholar 

  10. Monakhov, O.G.: Parametrical description of structures of homogeneous computer systems. Vychislitelnye sistemy (Computer systems), Novosibirsk (80), 3–17 (1979)

    Google Scholar 

  11. Monakhov, O.G., Monakhova, E.A.: A Class of Parametric Regular Networks for Multicomputer Architectures. Int’l Scientific Journal Computacion y Sistemas (Computing and Systems) 4(2), 85–93 (2000)

    Google Scholar 

  12. Monakhov, O.G., Monakhova, E.A.: Parallel Systems with Distributed Memory: Structures and Organization of Interactions, Novosibirsk. SB RAS Publ. (2000) (in Russian)

    Google Scholar 

  13. Monakhova, E.A.: On analytical representation of optimal two-dimensional Diophantine structures of homogeneous computer systems. Computing systems, 90, Novosibirsk, 81–91 (1981)

    Google Scholar 

  14. Morillo, P., Comellas, F., Fiol, M.A.: The optimization of chordal ring networks. Communication Technology, World Scientific, 295–299 (1987)

    Google Scholar 

  15. Schwefel, H.-P., Baeck, T.: Artificial evolution: How and why?, Genetic Algorithms and Evolution Strategy in Engineering and Computer Science – Recent advances and industrial applications, pp. 1–19. Wiley, Chichester (1997)

    Google Scholar 

  16. Yebra, J.L.A., Fiol, M.A., Morillo, P., Alegre, I.: The diameter of undirected graphs associated to plane tessellations. Ars Combinatoria 20B, 159–172 (1985)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monakhov, O., Monakhova, E. (2003). An Algorithm for Discovery of New Families of Optimal Regular Networks. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds) Discovery Science. DS 2003. Lecture Notes in Computer Science(), vol 2843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39644-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39644-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20293-6

  • Online ISBN: 978-3-540-39644-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics