The idea of Hopfield network is based on the king spin glass model in which each spin has only two possible states: up and down. By introducing stochastic factors into this network and performing a simulated annealing process on it, it becomes a Boltzmann machine which can escape from local minimum states to achieve the global minimum. This paper generalizes the above ideas to multi-value case ...

ing Asynchronous Multi-Valued Networks

‎In this paper‎, ‎we propose a new one-step iterative process for a‎ ‎countable family of quasi-nonexpansive multi-valued mappings in a‎ ‎CAT(0) space‎. ‎We also prove strong and $Delta$-convergence theorems‎ ‎of the proposed iterative process under some control conditions‎. ‎Our‎ ‎main results extend and generalize many results in the literature.

In this paper, under some appropriate conditions, we prove some $Delta$ and strong convergence theorems of endpoints for multi-valued nonexpansive mappings using modified Agarwal-O'Regan-Sahu iterative process in the general setting of 2-uniformly convex hyperbolic spaces. Our results extend and unify some recent results of the current literature.

In the optimization of decision diagrams, variable reordering approaches are often used to minimize the number of nodes. However, such approaches are less effective for analysis of multi-state systems given by monotone structure functions. Thus, in this paper, we propose algorithms to minimize the number of edges in an edge-valued multi-valued decision diagram (EVMDD) for fast analysis of multi...