中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共7条，第1-7条 帮助

已选(0)清除 条数/页：   排序方式：
Distributed algorithm for epsilon-generalized Nash equilibria with uncertain coupled constraints 期刊论文
AUTOMATICA, 2021, 卷号: 123, 页码: 9
作者:  Chen, Guanpu;  Ming, Yang;  Hong, Yiguang;  Yi, Peng
收藏  |  浏览/下载：164/0  |  提交时间：2021/04/26
Distributed algorithm  Generalized Nash equilibrium  Uncertainty  Coupled constraint  
Performance analysis of switched linear systems under arbitrary switching via generalized coordinate transformations 期刊论文
SCIENCE CHINA-INFORMATION SCIENCES, 2019, 卷号: 62, 期号: 1, 页码: 11
作者:  Lin, Meili;  Sun, Zhendong
收藏  |  浏览/下载：181/0  |  提交时间：2019/01/11
generalized coordinate transformation  matrix set measure  spectral abscissa  switched linear system  
Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters 期刊论文
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2016, 卷号: 42, 期号: 7, 页码: 623-639
作者:  Su, Guoxin;  Feng, Yuan;  Chen, Taolue;  Rosenblum, David S.
收藏  |  浏览/下载：174/0  |  提交时间：2018/07/30
Asymptotic perturbation bound  discrete-time Markov chain  numerical iteration  optimization  parametric Markov chain  perturbation analysis  probabilistic model checking  quadratic programming  
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization 期刊论文
MATHEMATICAL PROGRAMMING, 2015, 卷号: 152, 期号: 1-2, 页码: 491-520
作者:  Grapiglia, Geovani N.;  Yuan, Jinyun;  Yuan, Ya-xiang
收藏  |  浏览/下载：114/0  |  提交时间：2018/07/30
Global convergence  Worst-case complexity  Trust-region methods  Regularization methods  Unconstrained Optimization  Composite nonsmooth optimization  Multiobjective optimization  
A new algorithm for computing the minimum Hausdorff distance between two point sets on aline under translation 期刊论文
INFORMATION PROCESSING LETTERS, 2008, 卷号: 106, 期号: 2, 页码: 52-58
作者:  Li, Banghe;  Shen, Yuefeng;  Li, Bo
浏览  |  Adobe PDF(442Kb)  |  收藏  |  浏览/下载：512/130  |  提交时间：2018/07/30
Hausdorff Distance  Pattern Recognition  Computational Geometry  
An O(n log n) average time algorithm for computing the shortest network under a given topology 期刊论文
ALGORITHMICA, 1999, 卷号: 23, 期号: 4, 页码: 354-362
作者:  Xue, G;  Du, DZ
收藏  |  浏览/下载：100/0  |  提交时间：2018/07/30
analysis of algorithms  Steiner minimum trees  shortest network under a given topology  
TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS 期刊论文
DISCRETE APPLIED MATHEMATICS, 1991, 卷号: 31, 期号: 3, 页码: 227-260
作者:  CHEN, B
收藏  |  浏览/下载：89/0  |  提交时间：2018/07/30
BIN PACKING  MULTIPROCESSOR SCHEDULING  HEURISTIC ALGORITHMS  UNIFORM PROCESSORS  WORST-CASE ANALYSIS  PERFORMANCE RATIO