Khaliq, An efficient high-order algorithm for solving systems of reaction-diffusion equations, Numer. Methods Partial Differen. Equat. 18 (2002) 340-354.Y. Gu, W. Liao, J. Zhu, An efficient high-order algorithm
Sheng, "An efficient high order multi- level fast multipole algorithm for electromagnetic scattering analysis," Progress In Electromagn. Res., vol. 126, pp. 85-100, 2012.Pan, X.-M., L. Cai, and X.-Q. Sheng, "An efficient high order multilevel fast multipole algorithm for electromagnetic...
In this paper, an efficient high-order gas-kinetic scheme (EHGKS) is proposed to solve the Euler equations for compressible flows. We re-investigate the underlying mechanism of the high-order gas-kinetic scheme (HGKS) and find a new strategy to improve its efficiency. The main idea of the...
algorithm using video sequences with different animals and experimental conditions. The results show that our algorithm achieves state-of-the-art accuracy using an efficient approach without the need of learning processes, complex feature maps or knowledge of the animal shape.ToxIdis also ...
In order to improve policy evaluation performance, we propose an optimization algorithm based on the DPCA (Density Peak Cluster Algorithm) to improve the clustering effect on large-scale complex policy sets. Combined with this algorithm, an efficient policy evaluation engine, named DPEngine, is ...
In addition, we use protein interaction network of Drosophila to compare Twadn and the static network alignment algorithm NetCoffee2 and experimental results show that Twadn is able to capture timing information compared to NetCoffee2. Conclusions Twadn is a versatile and efficient alignment tool ...
we introduce an energy efficient algorithm for these networks which is called minimum energy algorithm (MEA). The detailed analysis verifies that the proposed algorithm has the minimum energy consumption. Although the main emphasis of the proposed technique is on minimizing the energy, it somehow bala...
A comparison of our results with well known analytical techniques like the B-Spline Method and the Adomian Decomposition Method (ADM) dictates that the ANN-SOS algorithm is fast and efficient. Four Bratu problems are considered. Problem one is an initial value problem, and the rest of the ...
In this work, we present an efficient GPU implementation scheme “Scatter Without Write Conflict” (SWiC) for large advanced 3D stencil patterns involving non-axis-aligned grid points. Unlike other 3D caching schemes, SWiC only needs 2D caching and a single pass over the stencil per iteration. ...
which will greatly improve algorithm efficiency, and a small cost of disk access for range queries, with more efficient performance). Experiments prove that the space, algorithm time and disk I/O of the HD-tree are superior to those of the D-tree. As a result, the half decomposition strate...