Search Results for ""

The problem in calculus of variations to find the minimal surface of a boundary with specified constraints (usually having no singularities on the surface). In general, there ...

A problem in the calculus of variations. Let a vessel traveling at constant speed c navigate on a body of water having surface velocity u = u(x,y) (1) v = v(x,y). (2) The ...

Consider a horse rider who wishes to feed his horse at a field, gather water from a river, and then return to his tent, all in the smallest overall distance possible. The ...

The problem of determining (or counting) the set of all solutions to a given problem.

Maximize the distance a Jeep can penetrate into the desert using a given quantity of fuel. The Jeep is allowed to go forward, unload some fuel, and then return to its base ...

The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...

Given a ship with a known constant direction and speed v, what course should be taken by a chase ship in pursuit (traveling at speed V) in order to intercept the other ship ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...

A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...

The question of whether a solution to a given problem exists. The existence problem can be solved in the affirmative without actually finding a solution to the original ...