TOPICS
Search

Search Results for ""


9401 - 9410 of 13134 for Graph TheorySearch Results
A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...
The centroid is center of mass of a two-dimensional planar lamina or a three-dimensional solid. The mass of a lamina with surface density function sigma(x,y) is ...
Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...
The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...
Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...
The Heaviside step function is a mathematical function denoted H(x), or sometimes theta(x) or u(x) (Abramowitz and Stegun 1972, p. 1020), and also known as the "unit step ...
Homology is a concept that is used in many branches of algebra and topology. Historically, the term "homology" was first used in a topological sense by Poincaré. To him, it ...
A hyper-Kähler manifold can be defined as a Riemannian manifold of dimension 4n with three covariantly constant orthogonal automorphisms I, J, K of the tangent bundle which ...
By way of analogy with the usual tangent tanz=(sinz)/(cosz), (1) the hyperbolic tangent is defined as tanhz = (sinhz)/(coshz) (2) = (e^z-e^(-z))/(e^z+e^(-z)) (3) = ...
Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...
1 ... 938|939|940|941|942|943|944 ... 1314 Previous Next

...