Search Results for ""
201 - 210 of 1636 for Bin Packing ProblemSearch Results
A necessary and sufficient condition that there should exist at least one nondecreasing function alpha(t) such that mu_n=int_(-infty)^inftyt^ndalpha(t) for n=0, 1, 2, ..., ...
The resultant of the vectors represented by the three radii from the center of a triangle's circumcircle to its polygon vertices is the segment extending from the ...
For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...
Given an open subset U in n-dimensional space and two compact subsets C_0 and C_1 of U, where C_1 is derived from C_0 by a continuous motion, is it possible to move C_0 to ...
Given two crossed ladders resting against two buildings, what is the distance between the buildings? Let the height at which they cross be h and the lengths of the ladders ...
A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...
Given a straight segment of track of length l, add a small segment Deltal so that the track bows into a circular arc. Find the maximum displacement d of the bowed track. The ...
Given a set P with |P|=p elements consisting of c_1 numbers 1, c_2 numbers 2, ..., and c_n numbers n and c_1+c_2+...+c_n=p, find the number of permutations with k-1 rises ...
Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n, {w_1,...,w_n} and each women has done ...
Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...
...
View search results from all Wolfram sites (160700 matches)

