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-17に以下より取得 https://scholargate.app/ja/compare