๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The minimal quantity of separating hyperplanes in a classification problem

โœ Scribed by Yu. A. Zak; V. M. Kotlov

Publisher
Springer US
Year
1975
Tongue
English
Weight
143 KB
Volume
9
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Classification of Linear Time-Optimal
A Classification of Linear Time-Optimal Control Problems in a Neighborhood of the Origin
โœ G.M. Sklyar; S.Yu. Ignatovich ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

The main goal of the paper is to classify time-optimal control problems for linear controllable systems with analytic coefficients. The reduction to the Markov moment min-problem is the main tool of this investigation. The constructive solution of the time-optimal control problem using mentioned red

Using a stopping rule to determine the s
Using a stopping rule to determine the size of the training sample in a classification problem
โœ Subrata Kundu; Adam T. Martinsek ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 326 KB

The problem of determining the size of the training sample needed to achieve sufficiently small misclassification probability is considered. The appropriate sample size is approximated using a stopping rule. The proposed procedure is asymptotically optimal. (~) 1998 Elsevier Science B.V.

Minimization of the makespan in a two-ma
Minimization of the makespan in a two-machine problem under given resource constraints
โœ Adam Janiak ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 163 KB

In the paper the classical two-machine ยฏow-shop problem was generalized to the case when job processing times may be reduced linearly by the application of a limited, continuously divisible resource, e.g. ยฎnancial outlay, energy, fuel, catalyzer etc. It is proved that the decision form of this probl