- suboptimal solution
- мат. субоптимальное решение
Большой англо-русский и русско-английский словарь. 2001.
suboptimal solution
Смотреть что такое "suboptimal solution" в других словарях:
suboptimal — adjective less than optimal A quickly produced suboptimal solution to a problem is often more useful than an optimal one that takes a long time to produce … Wiktionary
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
Fast Kalman filter — The fast Kalman filter (FKF), devised by Antti Lange (1941 ), is an extension of the Helmert Wolf blockingfn|1 (HWB) method from geodesy to real time applications of Kalman filtering (KF) such as satellite imaging of the Earth. Kalman filters are … Wikipedia
Machinima — For the website of the same name, see Machinima.com. A scene from Rooster Teeth Productions popular machinima series Red vs. Blue: The Blood Gulch Chronicles Machinima ( … Wikipedia
Sequence assembly — In bioinformatics, sequence assembly refers to aligning and merging fragments of a much longer DNA sequence in order to reconstruct the original sequence. This is needed as DNA sequencing technology cannot read whole genomes in one go, but rather … Wikipedia
С — Сальдо (balance) Cальдо внешней торговли [balance of trade] Сальдо государственного бюджета [balance of state budget] Сальдо торгового баланса см. Сальдо внешней … Экономико-математический словарь
Субоптимальное решение — [suboptimal solution] решение, оптимальное по одной из частичных целевых функций (в модели векторной оптимизации) … Экономико-математический словарь
Nucleic acid structure prediction — This article is about the computational prediction of nucleic acid structure. For experimental methods, see Nucleic acid structure determination. Nucleic acid structure prediction is a computational method to determine nucleic acid secondary and… … Wikipedia
Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… … Wikipedia
Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… … Wikipedia
Global serializability — In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, Global serializability (or Modular serializability) is a property of a global schedule of transactions. A… … Wikipedia
