Sentence examples for the searching problem from inspiring English sources

The searching problem is solved by relaxing to a continuous convex optimization problem.

We emphasize that the definition above is focused on the searching problem (which is the tough task here): the algorithms' outputs are the virtual addresses where the retriever Y can retrieve the messages.

For example, the searching problem given in the motivating example can be represented as an LTL formula of ((widetilde{Dates} wedge widetilde{Sightseeing} rightarrow widetilde{Price} wedge widetilde{HotelReservation})) (wedge ) ((respTime le 30)).

The core of the search problem is the inversion set of the optimal filter.

Heuristics take two arguments: a state in the search problem (the main argument), and the problem itself (for reference information).

Since the search problem is NP-hard, the methods are heuristically designed.

If targets are not explicitly known and used to help optimize search, the search problem is NP-hard.

In this paper we examine the search problem in autotuning from a mathematical optimization perspective.

The search problem involved in folding however has been simplified through the evolution of folding energy landscapes that are funneled.

After devoting months to the project in 2009, he made a breakthrough, solving the search problem and locating many more devices.

But in virtual worlds, which are made up of not text but 3-D renderings of people, places, and objects, the search problem is harder.