ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

确定性元胞自动机×蒙特卡洛模拟×
领域仿真决策
方法族Process / pipelineMCDM
起源年份1940s–1950s1949
提出者John von Neumann and Stanislaw UlamMetropolis, N., Ulam, S.
类型Discrete deterministic grid simulationRobustness wrapper — Monte Carlo uncertainty propagation
开创性文献von 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 ↗
别名Deterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid Model
相关60
摘要Deterministic 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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Deterministic Cellular Automata · MONTE-CARLO-SIMULATION. 于 2026-06-18 检索自 https://scholargate.app/zh/compare