Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
—Spatial computing systems are characterized by the extended physical environment in which they exist and function. Often this environment can be manipulated in various ways by t...
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...