ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Deterministiske cellulære automater×Monte Carlo-simulering×
FagfeltSimuleringBeslutningstaking
FamilieProcess / pipelineMCDM
Opprinnelsesår1940s–1950s1949
OpphavspersonJohn von Neumann and Stanislaw UlamMetropolis, N., Ulam, S.
TypeDiscrete deterministic grid simulationRobustness wrapper — Monte Carlo uncertainty propagation
Opprinnelig kildevon 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 ↗
AliasDeterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid Model
Relaterte60
SammendragDeterministic 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.
ScholarGateDatasett
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Deterministic Cellular Automata · MONTE-CARLO-SIMULATION. Hentet 2026-06-17 fra https://scholargate.app/no/compare