$#C+1 = 14 : ~/encyclopedia/old_files/data/A110/A.1100360 Additive selection
which is a [[Homomorphism|homomorphism]] (of semi-groups) and a selection of $ F $.
2 KB (318 words) - 16:09, 1 April 2020
$#C+1 = 161 : ~/encyclopedia/old_files/data/S083/S.0803860 Selection theorems
...n solving various combinatorial problems. Below some of the most important selection theorems are listed, and examples of their application are given.
13 KB (1,942 words) - 08:13, 6 June 2020
| This article ''MODEL SELECTION'' was adapted from an original article by Georges Nguefack-Tsague, which ap
'''MODEL SELECTION'''
17 KB (2,653 words) - 16:21, 10 March 2024
-
672 bytes (99 words) - 15:21, 1 May 2014
...rithmetic (cf. [[Arithmetic, formal|Arithmetic, formal]]) the constructive selection principle can be expressed by the following arithmetic formula
Sometimes the term "constructive selection principle" is specially linked to this latter form of argument, since the
7 KB (1,033 words) - 17:48, 1 November 2014
#REDIRECT [[Bolzano-Weierstrass selection principle]]
53 bytes (4 words) - 18:51, 24 March 2012
...ctive choice of the required segment. Accordingly, the Bolzano–Weierstrass selection principle can be used in this case only to prove an existence theorem which
3 KB (522 words) - 16:49, 6 August 2014
...esign; control (cf. [[Control system|Control system]]); signal processing; selection of most reliable populations (in [[Statistics|statistics]]); optimal treatm
..."Genetic programming: on the programming of computers by means of natural selection and genetics" , MIT (1992)</td></tr><tr><td valign="top">[a5]</td> <td val
2 KB (296 words) - 16:58, 1 July 2020
...esign; control (cf. [[Control system|Control system]]); signal processing; selection of most reliable populations (in [[Statistics|statistics]]); optimal treatm
..."Genetic programming: on the programming of computers by means of natural selection and genetics" , MIT (1992)</td></tr><tr><td valign="top">[a5]</td> <td val
2 KB (296 words) - 16:58, 1 July 2020
$#C+1 = 14 : ~/encyclopedia/old_files/data/A110/A.1100360 Additive selection
which is a [[Homomorphism|homomorphism]] (of semi-groups) and a selection of $ F $.
2 KB (318 words) - 16:09, 1 April 2020
...ctive choice of the required segment. Accordingly, the Bolzano–Weierstrass selection principle can be used in this case only to prove an existence theorem which
3 KB (522 words) - 16:49, 6 August 2014
...izability, at least if the [[Constructive selection principle|constructive selection principle]] (or Markov's principle) is accepted. A real problem is the stud
1 KB (205 words) - 13:34, 17 March 2014
...s defined by the transmission of DNA from generation to generation through selection, crossover, and mutation. Genetic algorithms use such operators for detecti
...a population of samples defined using some representation and searches by selection, crossover, and mutation operators. The sample population is first randomly
6 KB (810 words) - 15:55, 10 July 2014
See also [[Passive constraint|Passive constraint]]. For a selection of references, see [[Mathematical programming|Mathematical programming]].
421 bytes (64 words) - 17:27, 14 October 2014
...entatives of a family of subsets of a finite set (see [[Selection theorems|Selection theorems]]). There is also a widespread statement of König's theorem in te
König's theorem is often used in various combinatorial questions relating to selection and extremal problems. A generalization to the case of infinite matrices is
2 KB (415 words) - 22:37, 26 October 2014
See also [[Active constraint|Active constraint]]. For a selection of references, see [[Mathematical programming|Mathematical programming]].
444 bytes (66 words) - 17:58, 14 October 2014
...sideration. Thus, Markov's [[Constructive selection principle|constructive selection principle]] in the form
...t to the intuitionistic theory of derivation implies Markov's constructive selection principle for primitive-recursive predicates. This is an argument in favour
4 KB (519 words) - 22:13, 5 June 2020
...rithmetic (cf. [[Arithmetic, formal|Arithmetic, formal]]) the constructive selection principle can be expressed by the following arithmetic formula
Sometimes the term "constructive selection principle" is specially linked to this latter form of argument, since the
7 KB (1,033 words) - 17:48, 1 November 2014
...ce based on the operation of adjoining contexts to strings, according to a selection procedure. Such grammars were introduced (in the external variant, with the
...://www.encyclopediaofmath.org/legacyimages/c/c110/c110370/c1103702.png" />-selection is a system
9 KB (1,242 words) - 17:17, 7 February 2011
...orithm may exist (see also [[Constructive selection principle|Constructive selection principle]]).
2 KB (374 words) - 21:07, 1 November 2014
i.e. one performs a cyclic
selection of the coordinate vectors <img align="absmiddle" border="0" src="https://ww
...h.org/legacyimages/c/c026/c026460/c02646034.png" /> iterations involving a
selection of all coordinate vectors <img align="absmiddle" border="0" src="https://ww
9 KB (1,265 words) - 17:28, 7 February 2011
...The strategy of player I is the selection of a row, that of player II the selection of a column. If player I chooses $i$ ($1\leq i\leq m$), while player II cho
2 KB (351 words) - 07:37, 23 August 2014
...$. A realization of such a random mapping is the result of a simple random selection from $\Sigma_n$.
782 bytes (121 words) - 17:57, 22 November 2016
$#C+1 = 161 : ~/encyclopedia/old_files/data/S083/S.0803860 Selection theorems
...n solving various combinatorial problems. Below some of the most important selection theorems are listed, and examples of their application are given.
13 KB (1,942 words) - 08:13, 6 June 2020
...cle above is known as von Neumann's measurable choice theorem. A number of selection theorems and some applications are discussed in [[#References|[a4]]].
.../TR><TR><TD valign="top">[a4]</TD> <TD valign="top"> T. Parthasarathy, "Selection theorems and their applications" , ''Lect. notes in math.'' , '''263''' , S
7 KB (994 words) - 08:01, 6 June 2020
...of one or more of the genetic operators (GOs): recombination, mutation and selection. The combined effect of the GOs applied in a particular generation $t\in N$
...$ satisfies $a\in s_{( \Theta,\Phi)}(P) \Rightarrow a\in P$, then $s$ is a selection operator.
6 KB (958 words) - 06:10, 19 April 2013
...of the fulfillment of the program depends on the single-valuedness of the selection.
1 KB (183 words) - 14:52, 1 May 2014
| This article ''MODEL SELECTION'' was adapted from an original article by Georges Nguefack-Tsague, which ap
'''MODEL SELECTION'''
17 KB (2,653 words) - 16:21, 10 March 2024