Criteria for the completeness of algorithms for fuzzy marking (Q2836651)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Criteria for the completeness of algorithms for fuzzy marking |
scientific article; zbMATH DE number 6183499
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Criteria for the completeness of algorithms for fuzzy marking |
scientific article; zbMATH DE number 6183499 |
Statements
3 July 2013
0 references
algebraic approach
0 references
point configuration marking
0 references
time series
0 references
criteria of algorithm completeness
0 references
0.83046883
0 references
0.8258312
0 references
0 references
0.82193667
0 references
0.8212191
0 references
0 references
Criteria for the completeness of algorithms for fuzzy marking (English)
0 references
The author studies the synthesis of adaptive algorithms for classification of points in plane configurations. The modified problem is based upon metrics for the neighborhood comparison and introduction of a continuous set of marks. Solvability criteria are given as well as completeness criteria for a family of solving rules.
0 references
