ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Deterministički stanični automati×Simulacija Monte Carlo×
PodručjeSimulacijaDonošenje odluka
ObiteljProcess / pipelineMCDM
Godina nastanka1940s–1950s1949
TvoracJohn von Neumann and Stanislaw UlamMetropolis, N., Ulam, S.
VrstaDiscrete deterministic grid simulationRobustness wrapper — Monte Carlo uncertainty propagation
Temeljni izvorvon 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 ↗
Drugi naziviDeterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid Model
Srodne60
SažetakDeterministic 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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Deterministic Cellular Automata · MONTE-CARLO-SIMULATION. Preuzeto 2026-06-17 s https://scholargate.app/hr/compare