Results 221 to 230 of about 40,126 (265)

A case study to compare the methods of SOC estimation for lithium-ion batteries using second-order RC circuit model. [PDF]

Sci Rep
Xu HY, Wang JL, Wang WW.
europepmc   +1 more source

Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms. [PDF]

Sensors (Basel)
Yamaguchi S.
europepmc   +1 more source

The tree labeling polytope: A unified approach to ancestral reconstruction problems. [PDF]

Cell Syst
Schmidt H, Raphael BJ.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A polynomial decomposition algorithm

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) = g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.
David R. Barton, Richard E. Zippel
openaire   +1 more source

Extended polynomial algorithms

Proceedings of the annual conference on - ACM'73, 1973
It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.
Anthony C. Hearn, Rüdiger G. K. Loos
openaire   +2 more sources

Matrix recursive polynomial interpolation algorithm: An algorithm for computing the interpolation polynomials

Journal of Computational and Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Messaoudi, A., Sadaka, R., Sadok, Hassane   +2 more
openaire   +3 more sources

Algorithms for symmetrical polynomials

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
A special representation for symmetrical polynomials is introduced. Algorithms for the ring operations and for several versions of Gauss' method to express an arbitrary symmetrical polynomial by the elementary symmetrical functions are given and analyzed. Empirical observations show that the representation which is the most economical in terms of space
openaire   +2 more sources

A Convergent Algorithm for Solving Polynomial Algorithms

Journal of the ACM, 1967
The method of steepest descent is applied in a convergent procedure to determine the zeros of polynomials having either real or complex coefficients. By expressing the polynomials in terms of the Siljak functions, the methods are readily programmed on a digital computer.
openaire   +2 more sources

A polynomial algorithm for partitioning problems

ACM Transactions on Embedded Computing Systems, 2010
This article takes a theoretical approach to focus on the algorithmic properties of hardware/software partitioning. It proposes a method with polynomial complexity to find the global optimum of an NP-hard model partitioning problem for 75% of occurrences under some practical conditions.
Seyed-Abdoreza Tahaee, Amir-Hossein Jahangir   +1 more
openaire   +1 more source