[图书][B] Decision Support System: Tools and Techniques

S Bandyopadhyay - 2023 - taylorfrancis.com
This book presents different tools and techniques used for Decision Support Systems (DSS),
including decision tree and table, and their modifications, multi-criteria decision analysis …

Towards derandomising markov chain monte carlo

W Feng, H Guo, C Wang, J Wang… - 2023 IEEE 64th Annual …, 2023 - ieeexplore.ieee.org
We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC)
algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of …

Deterministic random walks for rapidly mixing chains

T Shiraga, Y Yamauchi, S Kijima, M Yamashita - SIAM Journal on Discrete …, 2018 - SIAM
The rotor-router model is a deterministic process analogous to a simple random walk on a
graph, and the discrepancy of token configurations between the rotor-router model and its …

The cover time of deterministic random walks for general transition probabilities

T Shiraga - arXiv preprint arXiv:1602.07729, 2016 - arxiv.org
The deterministic random walk is a deterministic process analogous to a random walk. While
there are some results on the cover time of the rotor-router model, which is a deterministic …

[PDF][PDF] Analyses of Deterministic Processes Analogous to Finite Markov Chains

白髪丈晴 - 2017 - catalog.lib.kyushu-u.ac.jp
A Markov chain, or a random walk, is a simple and important stochastic process, which often
appears as mathematical models and analyses in diverse fields including theoretical …

Ergodic effects in token circulation

A Kosowski, P Uznański - Proceedings of the Twenty-Ninth Annual ACM-SIAM …, 2018 - SIAM
We consider a dynamical process in a network which distributes all particles (tokens)
located at a node among its neighbors, in a round-robin manner. We show that in the …

[HTML][HTML] The cover time of deterministic random walks for general transition probabilities

T Shiraga - Theoretical Computer Science, 2020 - Elsevier
A deterministic random walk is a deterministic process analogous to a random walk. While
there are some results on the cover time of the rotor-router model, which is a deterministic …

乱択と計算

来嶋秀治 - 応用数理, 2017 - jstage.jst.go.jp
抄録 This article is concerned with randomness in computation, from the viewpoint of
computational complexity. For the question if a randomization significantly improves …

一般の遷移確率に対する関数ルーターモデルの全訪問時間

白髪丈晴 - 研究報告アルゴリズム(AL), 2016 - ipsj.ixsq.nii.ac.jp
論文抄録 ランダムウォークの脱乱択化とは決定的過程でランダムウォークを模倣しようとする試みで
ある. ロータールーターモデルと呼ばれる単純ランダムウォークを模倣する決定的過程に対し …