- direction-finding problem
- задача принятия решения
Большой англо-русский и русско-английский словарь. 2001.
direction-finding problem
Смотреть что такое "direction-finding problem" в других словарях:
Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… … Wikipedia
Finding Neverland — Infobox Film name = Finding Neverland caption = Original poster director = Marc Forster writer = David Magee starring = Johnny Depp Kate Winslet Julie Christie Dustin Hoffman producer = Richard N. Gladstein Nellie Bellflower music = Jan A. P.… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
N-body problem — otheruses4|the problem in classical mechanics|the problem in quantum mechanics|Many body problem The n body problem is the problem of finding, given the initial positions, masses, and velocities of n bodies, their subsequent motions as determined … Wikipedia
n-body problem — This article is about the problem in classical mechanics. For the problem in quantum mechanics, see Many body problem. The n body problem is the problem of predicting the motion of a group of celestial objects that interact with each other… … Wikipedia
Gettier problem — A Gettier problem is a problem in modern epistemology issuing from counter examples to the definition of knowledge as justified true belief (JTB). The problem owes its name to a three page paper published in 1963, by Edmund Gettier, called Is… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Flatness problem — The local geometry of the universe is determined by whether the relative density Ω is less than, equal to or greater than 1. From top to bottom: a spherical universe with greater than critical density (Ω>1, k>0); a hyperbolic, underdense… … Wikipedia
Route inspection problem — 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. When the graph has an… … Wikipedia
Economic calculation problem — The economic calculation problem is a criticism of socialist economics. It was first proposed by Ludwig von Mises in 1920 and later expounded by Friedrich Hayek.cite book title= Economic calculation in the Socialist Commonwealth accessdate=2008… … Wikipedia
Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… … Wikipedia
