TOPICS
Search

Search Results for ""


71 - 80 of 240 for SIR ModelSearch Results
B. Chilton and R. Whorf have studied stellations of the triakis tetrahedron (Wenninger 1983, p. 36). Whorf has found 138 stellations, 44 of which are fully symmetric and 94 ...
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. ...
A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...
Calabi-Yau spaces are important in string theory, where one model posits the geometry of the universe to consist of a ten-dimensional space of the form M×V, where M is a four ...
A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...
The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...
The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...
Let phi(x_1,...,x_m) be an L_(exp) formula, where L_(exp)=L union {e^x} and L is the language of ordered rings L={+,-,·,<,0,1}. Then there exist n>=m and f_1,...,f_s in ...
A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...
The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...
1 ... 5|6|7|8|9|10|11 ... 24 Previous Next

...