32 research outputs found
Minimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane
Full text linkA representation of an arbitrary system of strict linear inequalities in R^n
as a system of points is proposed. The representation is obtained by using a
so-called polarity. Based on this representation an algorithm for constructing
a committee solution of an inconsistent plane system of linear inequalities is
given. A solution of two problems on minimal committee of a plane system is
proposed. The obtained solutions to these problems can be found by means of the
proposed algorithm.Comment: 29 pages, 2 figure
Approximation issues of combinatorial optimization problems induced by optimal piecewise-linear learning procedures
No full textComputational complexity of combinatorial optimization problems induced by collective procedures in machine learning
Full text linkComputational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
Full text link
Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
Full text linkPolynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows
Full text link
