Committees of systems of linear inequalities / Mazurov VD,Khachai MY // AUTOMATION AND REMOTE CONTROL. - 2004. - V. 65, l. 2. - P. 193-203.

ISSN/EISSN:

0005-1179 / нет данных

Type:

Article

Abstract:

The conceptual issues of the theory of committee decision rules were considered, and its close relationship with the theory of substantiation of collective decision making and teaching neural networks was demonstrated. The problem of the minimum committee of an incompatible system of constraints, which arises at the stage of constructing the committee decision rule with a small number of elements, was discussed by itself. The problem of the minimum committee is known to be NP-hard. Results concerning estimation of the computational complexity of allied problems were obtained. To solve the problem of minimum committee of an incompatible system of linear inequalities, an effective approximate algorithm was suggested, its correctness was proved and computational complexity and guaranteed precision were estimated.

Author keywords:

нет данных

DOI:

10.1023/B:AURC.0000014716.7751

Web of Science ID:

ISI:000188975600006

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	FEB
Publisher	MAIK NAUKA/INTERPERIODICA
Address	C/O KLUWER ACADEMIC-PLENUM PUBLISHERS, 233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
Research-Areas	Automation \& Control Systems; Instruments \& Instrumentation
Web-of-Science-Categories	Automation \& Control Systems; Instruments \& Instrumentation
ResearcherID-Numbers	Khachay, Michael/H-3251-2013
ORCID-Numbers	Khachay, Michael/0000-0003-3555-0080
Number-of-Cited-References	13
Usage-Count-Since-2013	1
Journal-ISO	Autom. Remote Control
Doc-Delivery-Number	774JD