A pressing problem was finding space for additions to the library which now required an extra 1 miles of shelving each year.

Later the meaning expanded, indicating a person who is a quick thinker in finding a solution for a problem.

On-sighting is a form of adventure climbing emphasizing the skills of route finding, quick thinking and problem solving.

He would understand they had a real problem when they start finding several of these things flying around the place.

Further, 43 percent of respondents said they use less than half the functionality of their existing system ; 72 percent indicated they would trade functionality for ease of use ; 51 percent cited data synchronization as a major issue ; and 67 percent said that finding time to evaluate systems was a major problem.

For example, consider the problem of finding an integer x such that

They are also related to optimization problems, which are concerned with finding the best answer to a particular problem.

The problem of finding the Delaunay triangulation of a set of points in d-dimensional Euclidean space can be converted to the problem of finding the convex hull of a set of points in ( d + 1 )- dimensional space, by giving each point p an extra coordinate equal to | p |< sup > 2 </ sup >, taking the bottom side of the convex hull, and mapping back to d-dimensional space by deleting the last coordinate.

Fermat's proof was never found, and the problem of finding a proof for the theorem went unsolved for centuries.

An application of Euclidean solid geometry is the determination of packing arrangements, such as the problem of finding the most efficient packing of spheres in n dimensions.

The critical step of finding a mapping between the problem and a pre-existing schema is often cited as supporting the centrality of analogical thinking to problem solving.

The first step in finding a real solution was to mount the weapon on the aircraft, but the propeller remained a problem since the best direction to shoot is straight ahead.

: the problem of finding optimal colorings of graphs that are not necessarily planar.

A common problem, called the subgraph isomorphism problem, is finding a fixed graph as a subgraph in a given graph.

Unfortunately, finding maximal subgraphs of a certain kind is often an NP-complete problem.

A similar problem is finding induced subgraphs in a given graph.

The Pharisees of Judea emerged as the new leaders of the Jewish community after the war, and the loss of the Temple and its priests and the ritual of sacrifice faced them with the problem of finding a new Jewish identity.

The problem lies in finding a way to unite the patriarchal theme of divine promise to the primeval history, with its theme of God's continuing mercy in the face of man's sinful nature.

Redburn and White-Jacket had no problem finding publishers.

In 1997, Juan Maldacena gave the first holographic descriptions of a higher dimensional object, the 3 + 1 dimensional type IIB membrane, which resolved a long-standing problem of finding a string description which describes a gauge theory.

This circumstance in the patient's case plus the fact that his tactual capacity remained basically in sound working order constitutes its exceptional value for the problem at hand since the evidence presented by the authors is overwhelming that, when the patient closed his eyes, he had absolutely no spatial ( that is, third-dimensional ) awareness whatsoever.

The closed molding of flexible urethane foams has been a problem ever since the introduction of the material ( molding in open molds was more feasible ).

Its necessity arises from the well-known fact that apart from relatively recent results concerning the hydrogen molecular ion ( see references therein for more details ), the quantum n-body problem cannot be solved analytically, much less in closed form.

While this gets around the infinite acceleration problem, it still would lead to closed timelike curves ( i. e., time travel ) and causality violations.

In 1912 he gave an algorithm that solves both the word and conjugacy problem for the fundamental groups of closed orientable two-dimensional manifolds of genus greater than or equal to 2,.

:: A finitely presented group has solvable word problem if and only if it can be embedded in every algebraically closed group

The Novikov self-consistency principle, also known as the Novikov self-consistency conjecture, is a principle developed by Russian physicist Igor Dmitriyevich Novikov in the mid-1980s to solve the problem of paradoxes in time travel, which is theoretically permitted in certain solutions of general relativity ( solutions containing what are known as closed timelike curves ).

In a 1990 paper by Novikov and several others, Cauchy problem in spacetimes with closed timelike curves, the authors state:

The authors of Cauchy problem in spacetimes with closed timelike curves write:

This is made clear in the above-mentioned Cauchy problem in spacetimes with closed timelike curves, where the authors write:

This is not a problem if the product's implementation is open and minimally encumbered, but it may as well be both closed and heavily encumbered ( e. g. by patent claims ).

This problem per se is quite clumsy to solve in closed form.

The heart of the problem according to Snelson is " tensegrity works the way it does because it is an equilibrium of contesting forces within a closed system.

This problem was compounded when New Inlet closed and vessels were no longer able to avoid navigating around the shoals.

:::" The heavy iron door closed behind me .... I sat on my bed, looked around the room and started to take in my new social circumstances … In my hand luggage which I brought with me were my already printed or only started works on my cosmic problem ; there was even some blank paper.

While this power is useful for designing reductions, the downside is that certain classes such as NP are not known to be closed under Cook reductions ( and are widely believed not to be ), so they are not useful for proving that a problem is in NP.

An advance on this technique is to normally run the motor in open loop mode, and only enter closed loop mode if the rotor position error becomes too large ; this will allow the system to avoid hunting or oscillating, a problem when servo gain is set too high.

However, in all but the simplest cases, the problem of determining ahead of time when two bodies will collide ( given some initial data ) has no closed form solution — a numerical root finder is usually involved.

In graph theory, a branch of mathematics, the Chinese postman problem ( CPP ), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a ( connected ) undirected graph.

The private initiatives solving a specific problem usually tends to create a limited but well focused user and vendor societies, often even closed user groups.

It builds a closed cup nest from mud pellets under eaves or similar locations on buildings usually in colonies, but sometimes fouling below nests can be a problem.

Every closed 3-manifold has a prime decomposition: this means it is the connected sum of prime three-manifolds ( this decomposition is essentially unique except for a small problem in the case of non-orientable manifolds ).