Search Results for ""
101 - 110 of 1636 for Bin Packing ProblemSearch Results
A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...
A hypothetic building design problem in optimization with constraints proposed by Bhatti (2000, pp. 3-5). To save energy costs for heating and cooling, an architect wishes to ...
Given any assignment of n-element sets to the n^2 locations of a square n×n array, is it always possible to find a partial Latin square? The fact that such a partial Latin ...
What is the largest number of subcubes (not necessarily different) into which a cube cannot be divided by plane cuts? The answer is 47 (Gardner 1992, pp. 297-298). The ...
Find the minimum number f(n) of subsets in a separating family for a set of n elements, where a separating family is a set of subsets in which each pair of adjacent elements ...
Let A={a_1,a_2,...} be a free Abelian semigroup, where a_1 is the identity element, and let mu(n) be the Möbius function. Define mu(a_n) on the elements of the semigroup ...
Solution of a system of second-order homogeneous ordinary differential equations with constant coefficients of the form (d^2x)/(dt^2)+bx=0, where b is a positive definite ...
Serre's problem, also called Serre's conjecture, asserts that the implication "free module ==> projective module" can be reversed for every module over the polynomial ring ...
Honaker's problem asks for all consecutive prime number triples (p,q,r) with p<q<r such that p|(qr+1). Caldwell and Cheng (2005) showed that the only Honaker triplets for ...
The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...
...
View search results from all Wolfram sites (160700 matches)

