Decision methods for some optimization problems in recognition theory

被引：1
|
作者：
Katerinochkina N.N. [1 ]
机构：
[1] Dorodnicyn Computing Centre, Russian Academy of Sciences, Moscow 119333
来源：
Pattern Recognition and Image Analysis | 2009年 / 19卷 / 3期
基金：
俄罗斯基础研究基金会;
关键词：
Binary Vector; Linear Inequality; Lexicographical Order; Nodal Solution; Recognition Theory;
D O I：
10.1134/S1054661809030080
中图分类号：
学科分类号：
摘要：
By optimizing different models of recognition algorithms, a number of discrete extreme problems appear. The search for the maximum solvable subsystem of the system of linear inequalities is one of these tasks. In certain cases additional requirements on a desired solvable subsystem can be imposed. The solution methods for some types of such tasks are proposed. © Pleiades Publishing, Ltd., 2009.
引用
收藏
页码：441 / 446
页数：5
相关论文
共 50 条
12345