Zobrazeno 1 - 10
of 173
pro vyhledávání: '"T, Polyak"'
Autor:
B. T. Polyak, M. V. Khlebnikov
Publikováno v:
Automation and Remote Control. 83:1724-1741
Publikováno v:
Frontiers in Education, Vol 4 (2019)
Learning and assessment systems have grown and taken shape to incorporate concepts from both models for assessment and models for learning. In this paper we argue that a third dimension is necessary. Not only is it important to understand what the ca
Externí odkaz:
https://doaj.org/article/ba1f7b2a62ca44ebac21d463c7df012d
Autor:
B. T. Polyak, M. V. Khlebnikov
Publikováno v:
Automation and Remote Control. 83:303-324
Autor:
Mikhail V. Khlebnikov, Boris T. Polyak
Publikováno v:
Automation and Remote Control. 82:1530-1553
An optimization approach to linear control systems has recently become very popular. For example, the linear feedback matrix in the classical linear-quadratic regulator problem can be viewed as a variable, and the problem can be reduced to the minimi
Publikováno v:
Frontiers in Psychology, Vol 8 (2017)
This paper describes a psychometrically-based approach to the measurement of collaborative problem solving skills, by mining and classifying behavioral data both in real-time and in post-game analyses. The data were collected from a sample of middle
Externí odkaz:
https://doaj.org/article/487baea13fc041a1a7dac72e357e6bcd
Publikováno v:
Automation and Remote Control. 82:1-40
The survey deals with the application of linear matrix inequalities to taking into account possible uncertainties (in the system description, exogenous disturbances, and the initial conditions) in the control analysis and synthesis for linear systems
Autor:
B. T. Polyak, M. V. Khlebnikov
Publikováno v:
Automation and Remote Control. 83:1818-1819
Autor:
Ilyas Fatkhullin, Boris T. Polyak
Publikováno v:
Computational Mathematics and Mathematical Physics. 60:795-807
The problem of minimizing the energy of a system of $$N$$ points on a sphere in $${{\mathbb{R}}^{3}}$$ , interacting with the potential $$U = \tfrac{1}{{{{r}^{s}}}}$$ , $$s > 0$$ , where $$r$$ is the Euclidean distance between a pair of points, is co
Publikováno v:
Numerical Functional Analysis and Optimization. 41:822-849
Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solut
Autor:
Alexander L. Fradkov, Boris T. Polyak
Publikováno v:
IFAC-PapersOnLine. 53:1373-1378
Control theory in the USSR after WW2 achieved serious successes in such fields as optimal control, absolute stability, delay systems, pulse and relay control. Later there was a huge peak of breakthrough research on adaptation, learning and pattern re