Search Results for ""
631 - 640 of 1636 for Bin Packing ProblemSearch Results
Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...
The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...
A string or word is said to be admissible if that word appears in a given sequence. For example, in the sequence aabaabaabaabaab..., a, aa, baab are all admissible, but bb is ...
A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...
A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...
The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...
Let S be partitioned into r×s disjoint sets E_i and F_j where the general subset is denoted E_i intersection F_j. Then the marginal probability of E_i is ...
A moment sequence is a sequence {mu_n}_(n=0)^infty defined for n=0, 1, ... by mu_n=int_0^1t^ndalpha(t), where alpha(t) is a function of bounded variation in the interval ...
If one event can occur in m ways and a second can occur independently of the first in n ways, then the two events can occur in mn ways.
...
View search results from all Wolfram sites (160700 matches)

