Search Results for ""
81 - 90 of 1848 for Shortest path problemSearch Results
Is there a planar convex set having two distinct equichordal points? The problem was first proposed by Fujiwara (1916) and Blaschke et al. (1917), but long defied solution. ...
This problem is NP-complete (Garey and Johnson 1983).
Given a set S of n nonnegative integers, the number partitioning problem requires the division of S into two subsets such that the sums of number in each subset are as close ...
The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...
In a given acute triangle DeltaABC, find the inscribed triangle whose perimeter is as small as possible. The answer is the orthic triangle of DeltaABC. The problem was ...
Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...
A boundary value problem is a problem, typically an ordinary differential equation or a partial differential equation, which has values assigned on the physical boundary of ...
The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.
A surveying problem which asks: Determine the position of an unknown accessible point P by its bearings from three inaccessible known points A, B, and C.
For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...
...
View search results from all Wolfram sites (161941 matches)

