Criteria for the completeness of algorithms for fuzzy marking
type: Item
instance of: scholarly article
zbMATH Open document ID: 1274.68308
author: N. Yu. Dorofeev
publication date: 2013-07-03T00:00:00Z
full work available at URL: p1551
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6183499
zbMATH Keywords: algebraic approach
zbMATH Keywords: point configuration marking
zbMATH Keywords: time series
zbMATH Keywords: criteria of algorithm completeness
MaRDI profile type: Publication
Recommended article: DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
Recommended article: The completion of a fuzzy measure and its applications
Recommended article: Q4275480
Recommended article: An algorithm for comparison of fuzzy sets
Recommended article: SPECIFICATION AND COMPUTING STATES IN FUZZY ALGORITHMS
Recommended article: Q3366788
Recommended article: Structural completeness in fuzzy logics
Recommended article: A fuzzy theory refinement algorithm
Recommended article: Q3786433
title: Criteria for the completeness of algorithms for fuzzy marking
published in: Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki
review text: 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.
description: scientific article; zbMATH DE number 6183499