ScholarGate
Assistent

Võrdle meetodeid

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

Deterministlikud rakulised automaadid×Monte Carlo simulatsioon×
ValdkondSimulatsioonOtsustamine
PerekondProcess / pipelineMCDM
Tekkeaasta1940s–1950s1949
LoojaJohn von Neumann and Stanislaw UlamMetropolis, N., Ulam, S.
TüüpDiscrete deterministic grid simulationRobustness wrapper — Monte Carlo uncertainty propagation
Algallikasvon Neumann, J. (1966). Theory of Self-Reproducing Automata. University of Illinois Press, Urbana, IL. (Edited and completed by A. W. Burks.) link ↗Metropolis, N., Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association DOI ↗
RööpnimetusedDeterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid Model
Seotud60
KokkuvõteDeterministic Cellular Automata (DCA) is a simulation method that models the evolution of complex systems through a regular grid of cells, each holding a discrete state, updated synchronously at each time step according to a fixed, deterministic rule applied to the cell and its neighbors. The outcome is fully reproducible given the same initial conditions and rule set.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: Deterministic Cellular Automata · MONTE-CARLO-SIMULATION. Loetud 2026-06-17 aadressilt https://scholargate.app/et/compare