Search Results for ""
711 - 720 of 750 for Knuth Bendix Completion AlgorithmSearch Results
The Ulam sequence {a_i}=(u,v) is defined by a_1=u, a_2=v, with the general term a_n for n>2 given by the least integer expressible uniquely as the sum of two distinct earlier ...
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...
The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...
The golden ratio, also known as the divine proportion, golden mean, or golden section, is a number often encountered when taking the ratios of distances in simple geometric ...
A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...
As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...
A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...
The game of life is the best-known two-dimensional cellular automaton, invented by John H. Conway and popularized in Martin Gardner's Scientific American column starting in ...
A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...
...
View search results from all Wolfram sites (11394 matches)

