Search Results for ""
661 - 670 of 1395 for order costSearch Results
Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
A matrix for which horizontal and vertical dimensions are the same (i.e., an n×n matrix). A matrix m may be tested to determine if it is square in Wolfram Language using ...
Given a system of two ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y), (2) let x_0 and y_0 denote fixed points with x^.=y^.=0, so f(x_0,y_0) = 0 (3) g(x_0,y_0) ...
The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...
The term "range" has two completely different meanings in statistics. Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j, the range of the random sample ...
A stem-and-leaf diagram, also called a stem-and-leaf plot, is a diagram that quickly summarizes data while maintaining the individual data points. In such a diagram, the ...
A second-order ordinary differential equation d/(dx)[p(x)(dy)/(dx)]+[lambdaw(x)-q(x)]y=0, where lambda is a constant and w(x) is a known function called either the density or ...
The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...
In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...
...
View search results from all Wolfram sites (24012 matches)

