Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Abdessamad Amir"'
Autor:
Rachid Belgacem, Abdessamad Amir
Publikováno v:
Journal of King Saud University: Science, Vol 30, Iss 4, Pp 561-567 (2018)
A new deflected subgradient algorithm is presented for computing a tighter lower bound of the dual problem. These bounds may be useful in nodes evaluation in a Branch and Bound algorithm to find the optimal solution of large-scale integer linear prog
Externí odkaz:
https://doaj.org/article/67c82d3bf2be461eb6f254ed41e71e01
Autor:
Abdessamad Amir, Rachid Belgacem
Publikováno v:
Journal of King Saud University: Science, Vol 30, Iss 4, Pp 561-567 (2018)
A new deflected subgradient algorithm is presented for computing a tighter lower bound of the dual problem. These bounds may be useful in nodes evaluation in a Branch and Bound algorithm to find the optimal solution of large-scale integer linear prog
Publikováno v:
General Letters in Mathematics, Vol 5, Iss 1, Pp 32-46 (2018)
The aim of this paper is to present a numerical method based on Bernoulli polynomials for numerical solutions of fractional differential equations(FDEs). The Bernoulli operational matrix of fractional derivatives[31] is derived and used together wit
Publikováno v:
International Journal of Mathematical Modelling and Numerical Optimisation. 11:196
By formulating the generalised Newton descent direction according to the parameter resulting from the calculation of the subgradient of the max function, a new version of NSVM (Fung and Mangasarian, 2004) is presented in this paper. This descent dire
Autor:
Abdessamad Amir, Naima Djelloul
Publikováno v:
International Journal of Computing Science and Mathematics. 10:580
For several types of machines learning problems, the support vector machine is a method of choice. The kernel functions are a basic ingredient in support vector machine theory. Kernels based on the concepts of orthogonal polynomials gave the great sa