ScholarGate
Assistent

Võrdle meetodeid

Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.

Rakuautomaadid×Monte Carlo simulatsioon×
ValdkondSimulatsioonOtsustamine
PerekondProcess / pipelineMCDM
Tekkeaasta1940s–1950s (formalized); 1970 (Conway's Game of Life); 2002 (Wolfram's systematic classification)1949
LoojaJohn von Neumann and Stanislaw Ulam (1940s–1950s); popularized by John Conway (1970) and Stephen Wolfram (1980s–2002)Metropolis, N., Ulam, S.
TüüpGrid-based computational simulation modelRobustness wrapper — Monte Carlo uncertainty propagation
AlgallikasWolfram, S. (2002). A New Kind of Science. Wolfram Media. ISBN: 978-1579550080Metropolis, N., Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association DOI ↗
RööpnimetusedCA, Hücresel Otomat (Cellular Automata), lattice model, grid-based simulation
Seotud50
KokkuvõteCellular automata (CA) is a grid-based computational simulation model, first formalized by John von Neumann and Stanislaw Ulam in the 1940s–1950s and brought to wide attention by John Conway's Game of Life (1970) and Stephen Wolfram's systematic classification (2002), in which a lattice of cells — each holding a finite discrete state — evolves in discrete time steps according to local neighborhood interaction rules, causing complex global patterns to emerge from simple local specifications.MONTE-CARLO-SIMULATION (Monte Carlo Simulation — Stochastic uncertainty propagation through MCDM model) is a ranking multi-criteria decision-making (MCDM) method introduced by Metropolis, N., Ulam, S. in 1949. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
ScholarGateAndmestik
  1. v1
  2. 2 Allikad
  3. PUBLISHED
  1. v1
  2. 1 Allikad
  3. PUBLISHED

Mine otsingusse Laadi slaidid alla

ScholarGateVõrdle meetodeid: Cellular Automata · MONTE-CARLO-SIMULATION. Loetud 2026-06-18 aadressilt https://scholargate.app/et/compare