- sequence of choices
- мат. последовательность возможностей выбора
Большой англо-русский и русско-английский словарь. 2001.
sequence of choices
Смотреть что такое "sequence of choices" в других словарях:
Sequence alignment — In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.[1]… … Wikipedia
Sequence motif — In genetics, a sequence motif is a nucleotide or amino acid sequence pattern that is widespread and has, or is conjectured to have, a biological significance. For proteins, a sequence motif is distinguished from a structural motif, a motif formed … Wikipedia
Spectral sequence — In the area of mathematics known as homological algebra, especially in algebraic topology and group cohomology, a spectral sequence is a means of computing homology groups by taking successive approximations. Spectral sequences are a… … Wikipedia
Condorcet method — Part of the Politics series Electoral methods Single winner … Wikipedia
Mixed logit — is a fully general statistical model for examining discrete choices. The motivation for the mixed logit model arises from the limitations of the standard logit model. The standard logit model has three primary limitations, which mixed logit… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Chinese restaurant process — Not to be confused with Chinese restaurant syndrome. In probability theory, the Chinese restaurant process is a discrete time stochastic process, whose value at any positive integer time n is a partition Bn of the set {1, 2, 3, … Wikipedia
Kemeny-Young method — The Kemeny Young method is a voting system that uses preferential ballots, pairwise comparison counts, and sequence scores to identify the most popular choice, and also identify the second most popular choice, the third most popular choice, and… … Wikipedia
Kemeny–Young method — Part of the Politics series Electoral methods Single winner … Wikipedia
