نتایج جستجو برای: quadratic t search method
تعداد نتایج: 2518227 فیلتر نتایج به سال:
We consider the family of relative Thue equations x − (t− 1)xy − (t+ 2)xy − y = μ, where the parameter t, the root of unity μ and the solutions x and y are integers in the same imaginary quadratic number field. We prove that there are only trivial solutions (with |x|, |y| ≤ 1), if |t| is large enough or if the discriminant of the quadratic number field is large enough or if Re t = −1/2 (there a...
The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts fea...
This paper compares some of the most efficient heuristic methods for the quadratic assignment problem. These methods are known as strict taboo search, robust taboo search, reactive taboo search and genetic hybrids. It is shown that the efficiency of these methods strongly depends on the problem type and that no one method is better than all the others. A fast method for tuning the short term me...
We consider nonlinear systems dx=dt = f(x(t)) where Df(x(t)) is known to lie in the convex hull of L matrices A1, : : : , AL 2 R n . For such systems, quadratic Lyapunov functions can be determined using convex programming techniques [1]. This paper describes an algorithm that either nds a quadratic Lyapunov function or terminates with a proof that no quadratic Lyapunov function exists. The alg...
We propose a general and simple method that handles free (or point-to-point) motion planning problem for redundant and non-redundant serial robots. The problem consists of linking two points in the operational space, under constraints on joint torques, jerks, accelerations, velocities and positions while minimizing a cost function involving significant physical parameters such as transfer time ...
Regularized and stabilized sequential quadratic programming methods are two classes of sequential quadratic programming (SQP) methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a regularized SQP method has been proposed that provides a strong connection between augmented Lagrangian methods and...
The projective special linear group PSL2(n) is 2-transitive for all primes n and 3-homogeneous for n≡ 3 (mod 4) on the set {0,1, · · · ,n−1,∞}. It is known that the extended odd-like quadratic residue codes are invariant under PSL2(n). Hence, the extended quadratic residue codes hold an infinite family of 2-designs for primes n≡ 1 (mod 4), an infinite family of 3-designs for primes n≡ 3 (mod 4)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید