Search Results for ""

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

A clause (i.e., a disjunction of literals) is called a Horn clause if it contains at most one positive literal. Horn clauses are usually written as L_1,...,L_n=>L(=¬L_1 v ... ...

The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...

Jacobi-Gauss quadrature, also called Jacobi quadrature or Mehler quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

To fit a functional form y=Ae^(Bx), (1) take the logarithm of both sides lny=lnA+Bx. (2) The best-fit values are then a = ...

The margin of error is an estimate of a confidence interval for a given measurement, result, etc. and is frequently cited in statistics. While phrases such as, "The poll has ...

A magic square is said to be p-multimagic if the square formed by replacing each element by its kth power for k=1, 2, ..., p is also magic. A 2-multimagic square is called ...