TOPICS
Search

Search Results for ""


11 - 20 of 108 for 600 CellSearch Results
Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...
A generalized mobile automaton is a generalization of the mobile automaton in which the automaton may have more than one active cell. Generalized mobile automata allow for ...
The term rectification is sometimes used to refer to the determination of the length of a curve. Rectification also refers to the operation which converts the midpoints of ...
Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...
Rule 250 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 50 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...
A class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules ...
A number which is simultaneously a nonagonal number N_m and a square number S_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n^2. (1) Completing the square and ...
Rule 150 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
1|2|3|4|5 ... 11 Previous Next

...