搜索结果: 1-10 共查到“控制理论 Algorithms”相关记录10条 . 查询时间(0.187 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:System Control Schemes based on Actor-Critic Learning Algorithms
Actor-Critic学习算法 系统 控制方案
2023/4/27
Robust control tools: graphical user-interfaces and LMI algorithms
Robust control graphics LMI algorithm control and numerical value the control design tools
2015/8/12
Gives some vague ideas about useful control design tools that might be based on LMI algorithms.
Distributed Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks
Wireless Sensor Networks Maximum Lifetime
2015/6/19
A sensor network of nodes with wireless transceiver capabilities and limited energy is considered. We propose distributed algorithms to compute an optimal routing scheme that maximizes the time at whi...
arrsive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the observations may depend on previous “outputs” of the algorithm. The consi...
Rearrsive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the observations may depend on previous “outputs” of the algorithm. The con...
PARALLE DOMAIN DECOMPOSITION ALGORITHMS FOR A GENERALIZED STOKES PROBLEM
Domain decomposition trace average oper
2007/12/17
In this paper, a generalized Stokes problem is solved by multi-subdomain decomposition methods, and three parallel domain decomposition algorithms are proposed and analyzed. The derived results show t...
ON CONVERGENCE AND RATE OF CONVERGENCE OF ALGORITHMS IN THE MOVER-STAYER MODEL
Mover-stayer model algorithms converge
2007/12/17
The convergence and rate of convergence of an iterative method of Wang and Scott[1] for obtaining maximum likelihood estimates for contingency tables derived from a mover-stayer model are discussed.
THE CONVERGENCE OF BROYDEN ALGORITHMS WITHOUT CONVEXITY ASSUMPTION
Broyden algorithms convergence convexi
2007/12/10
摘要 In this paper we discuss the convergence of the Broyden algorithms without convexity and exact line search assumptions. We proved that if the objective function is suitably smooth and the algorithm...
This paper presents a unified framework of the nonmonotone convex combinationalgorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignmentproblems. Global convergence results are estab...
We present two parallel algorithms based on the domain decomposition methodfor solving a variational inequality over a closed convex cone. First, construct an opencovering {Ω_i} of the original domain...