3154 search results - page 50 / 631 » Computing Closed Skycubes |
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
SASO
2008
IEEE
14 years 3 months ago
2008
IEEE
—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...
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
ICANN
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
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 ...