✦ LIBER ✦

Synthesis of a correct recognition algorithm as a minimal covering construction problem

✍ Scribed by I.V. Isaev

Publisher: Elsevier Science
Year: 1983
Weight: 375 KB
Volume: 23
Category: Article
ISSN: 0041-5553
DOI: 10.1016/s0041-5553(83)80059-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of recognition algorithms c

Construction of recognition algorithms correct for a given control sample

✍ Yu.I. Zhuravlev; I.V. Isaev 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 771 KB

Construction of a correct taxonomy algor

Construction of a correct taxonomy algorithm in expansions of the a class of recognition algorithms

✍ A.F. Mukhamedgaliev 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 288 KB

The completeness of a f&mily of taxonomy algorithms, represented in the form of two interconnected subfamilies, is considered. While constructing the algorithms, defining the completeness of each subfamily, it is snown that a correct algorithm exists in the class of recognition algorithms of the es