TOPICS
Search

Search Results for ""


121 - 130 of 259 for Evolutionary ProgrammingSearch Results
_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...
A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...
The Euler formula, sometimes also called the Euler identity (e.g., Trott 2004, p. 174), states e^(ix)=cosx+isinx, (1) where i is the imaginary unit. Note that Euler's ...
The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...
The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...
There are at least three theorems known as Jensen's theorem. The first states that, for a fixed vector v=(v_1,...,v_m), the function |v|_p=(sum_(i=1)^m|v_i|^p)^(1/p) is a ...
A goodness-of-fit test for any statistical distribution. The test relies on the fact that the value of the sample cumulative density function is asymptotically normally ...
A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...
The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...
What is the sofa of greatest area S which can be moved around a right-angled hallway of unit width? Hammersley (Croft et al. 1994) showed that S>=pi/2+2/pi=2.2074... (1) ...
1 ... 10|11|12|13|14|15|16 ... 26 Previous Next

...