Skip to main content
SpringerLink
Log in

Efficient Simulation of CA with Few Activities

  • Conference paper
Cellular Automata (ACRI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3305))

Included in the following conference series:

Abstract

Motivated by the wish to make large simulations of Bak’s sandpile model we investigate a simple method to simulate cellular automata with “few activities” efficiently on a computer.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Albuquerque, P., Dupuis, A.: A parallel cellular ant colony algorithm for clustering and sorting. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 220–240. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality: An explanation of the 1/f noise. Physical Review Letters 59(4), 381–384 (1987)

    Article  MathSciNet  Google Scholar 

  3. Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  4. Vollmar, R.: Some remarks about the ‘efficiency’ of polyautomata. International Journal of Theoretical Physics 21, 1007–1015 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Weimar, J.: Translations of cellular automata for efficient simulation. Complex Systems 14(2), 175–199 (2003)

    MATH  MathSciNet  Google Scholar 

  6. Worsch, T.: Simulation of cellular automata. Future Generation Computer Systems 16(2-3), 157–170 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IAKS Vollmar, Universität Karlsruhe, Germany

    Richard Walter & Thomas Worsch

Authors
  1. Richard Walter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Worsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walter, R., Worsch, T. (2004). Efficient Simulation of CA with Few Activities. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23596-5

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation