Results 221 to 230 of about 319,625 (266)
Some of the next articles are maybe not open access.
Applied Mathematics and Computation, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dmitry K. Firsov, Shiu Hong Lui
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dmitry K. Firsov, Shiu Hong Lui
openaire +1 more source
Computing in Science & Engineering, 2000
Accurate computation of the mutual interactions of N particles through electrostatic or gravitational forces has impeded progress in many areas of simulation science. The fast multipole algorithm (FMA) provides an efficient scheme for reducing computational complexity.
John Board, Klaus Schulten
openaire +1 more source
Accurate computation of the mutual interactions of N particles through electrostatic or gravitational forces has impeded progress in many areas of simulation science. The fast multipole algorithm (FMA) provides an efficient scheme for reducing computational complexity.
John Board, Klaus Schulten
openaire +1 more source
Engineering Applications of Artificial Intelligence, 2008
The aim of this paper is to design an efficient and fast clonal algorithm for solving various numerical and combinatorial real-world optimization problems effectively and speedily, irrespective of its complexity. The idea is to accurately read the inherent drawbacks of existing immune algorithms (IAs) and propose new techniques to resolve them.
Nitesh Khilwani +3 more
openaire +1 more source
The aim of this paper is to design an efficient and fast clonal algorithm for solving various numerical and combinatorial real-world optimization problems effectively and speedily, irrespective of its complexity. The idea is to accurately read the inherent drawbacks of existing immune algorithms (IAs) and propose new techniques to resolve them.
Nitesh Khilwani +3 more
openaire +1 more source
A fast algorithm for or-and-or synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003Design methods for OR-AND-OR three-level networks are useful for exploiting the flexibility of logic blocks in many complex programmable logic devices. This paper presents T RIMIN, a fast heuristic algorithm for designing OR-AND-OR networks from sum-of-products expressions.
Debatosh Debnath, Zvonko G. Vranesic
openaire +1 more source
Magnetic Resonance Imaging, 1992
Multispectral tissue classification using magnetic resonance T1, T2, and rho images may be useful in diagnosing and locating certain pathology. Techniques for generating the T1 images necessary for this classification scheme often require longer data collection and post processing times than are practical.
J, Gong, J P, Hornak
openaire +2 more sources
Multispectral tissue classification using magnetic resonance T1, T2, and rho images may be useful in diagnosing and locating certain pathology. Techniques for generating the T1 images necessary for this classification scheme often require longer data collection and post processing times than are practical.
J, Gong, J P, Hornak
openaire +2 more sources
An Algorithm of Fast Interpolation
2009 WRI World Congress on Computer Science and Information Engineering, 2009There are many approaches to realize interpolation. Padding zeros in the high frequency band of a real sequence results in interpolation in time domain. For the discrete frequency spectrum with high frequency band being zeros, this paper proposes a fast implementation method of inverse fast Fourier transform to reduce the computational cost.
Yechao Bai, Xinggan Zhang
openaire +1 more source
2010 International Conference on Computational Intelligence and Security, 2010
The HITON_PC algorithm which is a state-of-the-art local causal discovery algorithm can deal with a dataset with a very small sample-to-variable ratio efficiently. But it cannot perform inefficiently on a dataset with a very large sample. To address this problem, a fast HITON_PC algorithm is presented which uses a new yet simple search strategy from ...
openaire +1 more source
The HITON_PC algorithm which is a state-of-the-art local causal discovery algorithm can deal with a dataset with a very small sample-to-variable ratio efficiently. But it cannot perform inefficiently on a dataset with a very large sample. To address this problem, a fast HITON_PC algorithm is presented which uses a new yet simple search strategy from ...
openaire +1 more source
A FAST Pattern Matching Algorithm
Journal of Chemical Information and Computer Sciences, 2004The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the
Sheik, SS +4 more
openaire +2 more sources
Fast Algorithms for Approximating Distances
Algorithmica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergei Bespamyatnikh, Michael Segal 0001
openaire +1 more source
13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior.
openaire +1 more source
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior.
openaire +1 more source