Despite branching from a partial schedule with the minimum lower bound, the algorithm does not need large memory for keeping partial schedules as independent data, and does not require large comparability time for selecting a partial schedule to branch from.
AC algorithm is an automation algorithm, in which firstly a search tree based on pattern string sets was established, and then, the text is progressively scanned from front to back; since the size of search tree was related to the size of the character set, AC algorithm needed larger memory resources.
Most block-wise background initialization approaches need large memories and are computationally expensive.
Further, both methods are sensitive to the input parameters and therefore show variable performance when compared in other studies (Ilie et al., 2011; Kao et al., 2011; Kelley et al., 2010), and the full suffix tree data structure needs large memory resources.
Moreover, material model of the coupled heat and moisture transport leads after discretization to nonsymmetric systems of algebraic equations which need large computer memory.
Due to complex mathematical equations used in these models, they are time-consuming and need large amount of memory to be applied for controller design, especially power electronic interface controller design, generation and load predictions, optimization and other studies.
Moreover, the millions of parameters in the full connected layers need large space in storage and memory.
However, DBSCAN needs large volume of memory support and often has difficulties with high-dimensional data and clusters of very different densities.
Because of the large number of convolution operations, it needs large amounts of memory and computational cost.
However, direct solver needs very large memory, even though the sparsity of the matrix is fully exploited [12].
