Sentence examples for programming 1 from inspiring English sources

Linear Programming 1 (LP1): MRA.

That is, Convex Programming 1 (CPRA: PRA.

The plane ((w, b)) is obtained by solving the quadratic programming (1).

We can reformulate the SVM problem in quadratic programming (1) in an unconstraint problem.

However, by Theorem 3.2, we may verify that the point is a local optimal solution for the bilevel programming (1).

The result obtained is used to derive a necessary and sufficient condition for the bilevel programming (1).

Fractional programming problems have arisen in multiobjective programming [1, 2], game theory [3], and goal programming [4].

As examples, we give: the neural networks [15, 38], the k-nearest neighbor classifier [21], the support vector machines (SVM) [3, 24], the ensemble classifiers [2], the genetic programming [1] and the evolution strategies [31].

Here's how it breaks down: On average, young people spend 3 51 a day watching TV and videos (three hours on regular TV, the rest on recorded programming), 1 44 listening to music, 1 02 using computers (0 48 online, 0 14 offline), 0 49 playing videogames, 0 43 reading and 0 25 watching movies.

When there is uncertainty in the lower level optimization problem of a bilevel programming [1], it can be formulated by a robust optimization method as a bilevel programming problem having second-order cone programming [2] as its lower level problem, i.e., a bilevel programming problem with lower level second-order cone programs (SOCBLP).

INDDEx is based on Inductive Logic Programming [1], which learns easily interpretable qualitative logic rules from active ligands that give an insight into chemistry, relate molecular substructure to activity, and can be used to guide the next steps of drug design chemistry.