搜索结果: 1-13 共查到“信息科学与系统科学 algorithms”相关记录13条 . 查询时间(0.219 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：System Control Schemes based on Actor-Critic Learning Algorithms
Actor-Critic学习算法 系统 控制方案
font style='font-size:12px;'>
2023/4/27
System optimization and control have become the key design philosophies in modern control system theories, where reinforcement learning (RL) algorithm has drawn considerable attention in recent litera...
Robust control tools: graphical user-interfaces and LMI algorithms
Robust control graphics LMI algorithm control and numerical value the control design tools
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Analysis of Recursive Stochastic Algorithms
Recursive Stochastic Algorithms
font style='font-size:12px;'>
2014/8/13
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...
Analysis of Recursive Stochastic Algorithms
Analysis of Recursive Stochastic Algorithms
font style='font-size:12px;'>
2014/7/2
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...
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Non-adaptive probabilistic group noisy measurements Near-optimal bounds efficient algorithms
font style='font-size:12px;'>
2011/9/19
Abstract: We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noi...
PARALLE DOMAIN DECOMPOSITION ALGORITHMS FOR A GENERALIZED STOKES PROBLEM
Domain decomposition trace average oper
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS
font style='font-size:12px;'>
2007/8/7
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...
MINIMAL INVERSION AND ITS ALGORITHMS OF DISCRETE-TIME NONLINEAR SYSTEMS
Left-inverse discrete-time system nonl
font style='font-size:12px;'>
2007/8/7
The left-inverse system with minimal order and its algorithmsof discrete-time nonlinear systems are studied in a linearalgebraic framework. The general structure of left-inverse systemis described and...
A ROBUSTNESS ANALYSIS OF THE MUSIC AND THE MINIMUM-NORM ALGORITHMS WITH RESPECT TO CORRELMED NOISE
font style='font-size:12px;'>
2007/8/7
A robustness analysis of the MUSIC and the MiniNorm algorithms with respect to spatially correlated noise in array processing is presented in this paper. Let the covariance matrix of correlated noise ...
PARALLEL ALGORITHMS FOR VARIATIONAL INEQUALITIES BASED ON DOMAIN DECOMPOSITION
font style='font-size:12px;'>
2007/8/7
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...