Sentence examples for list algorithm from inspiring English sources
We present two modifications of the standard cell list algorithm that handle molecular dynamics simulations with deforming periodic geometry.
Previous works focused on the planar flows handled by Lees Edwards or Kraynik Reinelt boundary conditions, while the new versions of the cell list algorithm presented here are formulated to handle the general 3D deforming simulation geometry.
As in the case of equilibrium, for short-ranged pairwise interactions, the cell list algorithm reduces the computational complexity of the force computation from O N2) to O(N), where N is the total number of particles in the simulation box.
The Verlet neighbor list algorithm (Verlet, 1967), as one of the most efficient neighboring particle searching methods, was adopted in the presented model.
To help us assess the effect of each algorithm during the generation of word lists and word sense disambiguation, we incorporated data collection algorithms to store internal counts, i.e., number of terms generated from each word list algorithm, and the percentage contribution of disambiguation algorithms towards the final decision.
Our proposed neighbor cell list algorithms provide an efficient way to manage the neighbor cell list.
Therefore, the results in Figures 14 and 15 show that the proposed neighbor femtocell list algorithms for the femtocell-to-femtocell and the macrocell-to-femtocell handovers offer an optimal number of femtocells in the neighbor femtocell list.
In this paper, based on a cost-optimal parallel two-list algorithm, we propose a novel heterogeneous cooperative computing approach to solve the subset-sum problem on a hybrid CPU GPU cluster, which can make full use of all available computational resources of a cluster.
In order to assign the most suitable workload to each compute node and reasonably partition it between CPU and GPU within each node, and minimize the inter-node and intra-node communication costs, we design a communication-avoiding workload distribution scheme suitable for the parallel two-list algorithm.
Since UDHUP-apriori uses Apriori-like approach to recursively derive UDHUPs, a second UDHUP-list algorithm is then presented to efficiently discover UDHUPs based on the developed UDU-list structures and a pruning strategy without candidate generation, thus speeding up the mining process.
Do the Decreasing-Time-List Algorithm.
