- discrete criterion
- мат. дискретный критерий
Большой англо-русский и русско-английский словарь. 2001.
discrete criterion
Смотреть что такое "discrete criterion" в других словарях:
Jury stability criterion — The Jury stability criterion is a method of determining the stability of a linear discrete time system by analysis of the coefficients of its characteristic polynomial. It is the discrete time analogue of the Routh Hurwitz stability criterion.… … Wikipedia
The Criterion Collection — Type Private Industry Motion picture video production Founded 1984 … Wikipedia
Nyquist ISI criterion — Raised cosine response meets the Nyquist ISI criterion. Consecutive raised cosine impulses demonstrate the zero ISI property between transmitted symbols at the sampling instants. At t=0 the middle pulse is at its maximum and the sum of other… … Wikipedia
Routh-Hurwitz stability criterion — The Routh Hurwitz stability criterion is a necessary (and frequently sufficient) method to establish the stability of a single input, single output (SISO), linear time invariant (LTI) control system. More generally, given a polynomial, some… … Wikipedia
Fraysseix–Rosenstiehl's planarity criterion — In graph theory, a branch of mathematics, Fraysseix–Rosenstiehl s planarity criterion is a characterization of planarity based on the properties of the tree defined by a depth first search. Considering any depth first search of a graph G , the… … Wikipedia
List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… … Wikipedia
Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… … Wikipedia
Dead-end elimination — The dead end elimination algorithm (DEE) is a method for minimizing a function over a discrete set of independent variables. The basic idea is to identify dead ends , i.e., bad combinations of variables that cannot possibly yield the global… … 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
Comparison of instant runoff voting to other voting systems — This article is a comparison of various voting systems with Instant runoff voting (IRV), also called the Alternative Vote , preferential voting and ranked choice voting. Contents 1 Categories 2 Voting system criteria 3 Voting system results … Wikipedia
