Search Results for ""
71 - 80 of 1848 for Shortest path problemSearch Results
The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...
The problem of finding the connection between a continuous function f on the boundary partialR of a region R with a harmonic function taking on the value f on partialR. In ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
A path, also known as a rhumb line, which cuts a meridian on a given surface at any constant angle but a right angle. If the surface is a sphere, the loxodrome is a spherical ...
A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...
The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...
The Buffon-Laplace needle problem asks to find the probability P(l,a,b) that a needle of length l will land on at least one line, given a floor with a grid of equally spaced ...
The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...
The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
...