Today's resource allocation strategies for edge-cloud network based on Software-Defined
Network (SDN) and Network Function Virtualization (NFV) architectures often make a …

In this article, we introduce the subject of support vector machines (SVMs), describing their
applications to binary and multiclass classification as well as different SVM formulations that …

In this article, we have presented a method for finding the approximate center of a linear
programming polytope. This method provides a point near the center of a polytope in few …

A closed convex polytope in n dimensions is defined by the usual linear inequality
constraints specified as Ax≤ b. Let P be a strictly interior point within the closed polytope. If …

A closed convex polytope in n dimensions defined by m linear inequality constraints is
considered. If L is a straight line drawn in any direction from any feasible point P, then in …

We present a new approach to find an optimal large margin classifier based on the p-center
which was proposed by Moretti in 2003. Starting with the p-Center of a general polytope, we …

A simplex in n dimensions is defined by the usual (n+ 1) linear inequality constraints in n
dimensions. Here we consider simplexes which are bounded sets. The harmonic center has …

The problem of finding a deepest point (a ball centre) of a polyhedron is studied. A finite
combinatorial interior point method is presented for this problem which yields an algorithm …

The NxN system of linear equations, A0x= b0, represents N intersecting hyperplanes, whose
intersection is the solution to the system of equations. The solution is often obtained …

RÉSUMÉ L'Internet des objets (IdO) se caractérisant par un grand nombre des objets
connectés et une multitude d'applications intelligentes a été introduit pour améliorer la …