中文版 | English

在结果中检索

CSpace

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

限定条件                
已选(0)清除 条数/页：   排序方式：
Adaptive multi-fidelity polynomial chaos approach to Bayesian inference in inverse problems 期刊论文
JOURNAL OF COMPUTATIONAL PHYSICS, 2019, 卷号: 381, 页码: 110-128
作者:  Yan, Liang;  Zhou, Tao
收藏  |  浏览/下载：166/0  |  提交时间：2019/03/11
Bayesian inverse problems  Multi-fidelity polynomial chaos  Surrogate modeling  Markov chain Monte Carlo  
Generalized coefficient strengthening cuts for mixed integer programming 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2018, 卷号: 70, 期号: 1, 页码: 289-306
作者:  Chen, Wei-Kun;  Chen, Liang;  Yang, Mu-Ming;  Dai, Yu-Hong
收藏  |  浏览/下载：159/0  |  提交时间：2018/07/30
Mixed integer programming  Cutting plane method  Separation algorithm  Coefficient strengthening  
A new fully polynomial time approximation scheme for the interval subset sum problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
作者:  Diao, Rui;  Liu, Ya-Feng;  Dai, Yu-Hong
收藏  |  浏览/下载：106/0  |  提交时间：2018/07/30
Interval subset sum problem  Computational complexity  Solution structure  Fully polynomial time approximation scheme  Worst-case performance  
Dynamic Spectrum Management: A Complete Complexity Characterization 期刊论文
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 卷号: 63, 期号: 1, 页码: 392-403
作者:  Liu, Ya-Feng
收藏  |  浏览/下载：100/0  |  提交时间：2018/07/30
Complexity theory  multi-carrier communication system  spectrum management  strong NP-hardness  
Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach 期刊论文
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 卷号: 63, 期号: 14, 页码: 3641-3656
作者:  Liu, Ya-Feng;  Dai, Yu-Hong;  Ma, Shiqian
收藏  |  浏览/下载：102/0  |  提交时间：2018/07/30
Admission control  complexity  non-convex approximation  potential reduction algorithm  power control  sparse optimization  
Deterministic sampling of sparse trigonometric polynomials 期刊论文
JOURNAL OF COMPLEXITY, 2011, 卷号: 27, 期号: 2, 页码: 133-140
作者:  Xu, Zhiqiang
收藏  |  浏览/下载：98/0  |  提交时间：2018/07/30
Compressed sensing  Deterministic sampling  Weil sum  Sparse trigonometric polynomials  
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2008, 卷号: 23, 期号: 2, 页码: 251-258
作者:  Lu, Ye;  Yuan, Ya-Xiang
收藏  |  浏览/下载：101/0  |  提交时间：2018/07/30
interior-point algorithm  self-concordant barrier  trust-region subproblem