Results 251 to 260 of about 426,747 (281)
Some of the next articles are maybe not open access.

Empirical convergence algorithm for successive overrelaxation

Proceedings of the Institution of Electrical Engineers, 1974
The algorithm concerns the computing by successive overrelaxation (s.o.r.) of the magnetic vector potential at the nodes of a rectangular grid of graded meshes covering the pole pitch of a homopolar or of an heteropolar electrical machine. It has been applied to several cases with grids having up to 1400 nodes, and has operated practically without ...
openaire   +1 more source

Successful implementation of AES algorithm in hardware

2012 IEEE International Conference on Electronics Design, Systems and Applications (ICEDSA), 2012
Implementation of AES algorithm in hardware always found its bottleneck during the key scheduling process as it involves a lot of multiplication steps. This paper discusses how this bottleneck is identified, ways to overcome them and the implementation of the said algorithm with the improvement of the key scheduling result to a successful AES hardware ...
Rozita Borhan   +1 more
openaire   +1 more source

The Superlinear Convergence of Successive Quadratic Programming Algorithms

IFAC Proceedings Volumes, 1990
Convergence rate conditions are considered for sequential quadratic programming algorithms for equality and inequality constraints. The objective function of the quadratic subproblem includes a linear term that is dependent on constraint penalty functions and an approximate Hessian of the Lagrangian augmented by the penalty functions.
openaire   +1 more source

Mixing, Control Maps, and Genetic Algorithm Success

2002
On the face of it, the previous chapter would seem like good news. After all, solution accuracy and reliability were predictably controlled using nothing more than appropriate (sub- or near-linear) population sizing. Moreover, this happy circumstance appeared to occur on both easy and hard problems.
openaire   +1 more source

Symmetry of Successful Bases in Shor’s Algorithm

This paper proves a symmetry property in Shor’s factoring algorithm. When factoring a semiprime N=pq, the algorithm succeeds for bases 𝑎 whose order modulo N is even and avoids trivial roots of −1. We show that if such a base a is successful, then its symmetric counterpart N−a is also successful with the same order.
openaire   +1 more source

The successive projections algorithm for variable selection in spectroscopic multicomponent analysis

Chemometrics and Intelligent Laboratory Systems, 2001
M C Araújo, Takashi Yoneyama
exaly  

Multi-level rate-constrained successive elimination algorithm tailored to suboptimal motion estimation in HEVC

Signal Processing: Image Communication, 2020
Luc Trudeau   +2 more
exaly  

The successive projections algorithm for spectral variable selection in classification problems

Chemometrics and Intelligent Laboratory Systems, 2005
Márcio José Coelho Pontes, M C Araújo
exaly  

Similarity-based Assembly Success/Failure Estimation Algorithm

Transactions of the Korean Society of Mechanical Engineers - A, 2020
Minwoo Na, Tae-Jung Kim, Jae-Bok Song
openaire   +1 more source

Home - About - Disclaimer - Privacy