机构

• 数学与系统科学研究院 [4]
• 自动化研究所 [2]
• 沈阳自动化研究所 [2]
• 长春光学精密机械与物... [1]
• 软件研究所 [1]

采集方式

• OAI收割 [10]

内容类型

• 期刊论文 [5]
• 会议论文 [4]
• 学位论文 [1]

发表日期

• 2022 [2]
• 2021 [1]
• 2018 [1]
• 2016 [1]
• 2015 [1]
• 2011 [1]
• 更多

学科主题

筛选

浏览/检索结果: 共10条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序作者升序作者降序 A convex programming solution based debiased estimator for quantile with missing response and high-dimensional covariables 期刊论文  OAI收割 COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2022, 卷号: 168, 页码: 14 作者:  Su, Miaomiao;  Wang, Qihua   |  收藏  |  浏览/下载：41/0  |  提交时间：2022/04/02 High dimensions  Missing at random  Marginal response quantile  Optimal weights  Selection probability function   On the System Performance of Mobile Edge Computing in an Uplink NOMA WSN With a Multiantenna Access Point Over Nakagami-m Fading 期刊论文  OAI收割 IEEE/CAA Journal of Automatica Sinica, 2022, 卷号: 9, 期号: 4, 页码: 668-685 作者:  Van-Truong Truong, Van Nhan Vo, Dac-Binh Ha, Chakchai So-In   |  收藏  |  浏览/下载：32/0  |  提交时间：2022/03/09 Mobile edge computing (MEC),Nakagami-m fading,offloading,selection combining (SC)/maximal ratio combining (MRC),successful computation probability (SCP),uplink nonorthogonal multiple access (NOMA),wireless sensor networks (WSNs)   Robust model selection with covariables missing at random 期刊论文  OAI收割 ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2021, 页码: 19 作者:  Liang, Zhongqi;  Wang, Qihua;  Wei, Yuting   |  收藏  |  浏览/下载：26/0  |  提交时间：2022/04/02 Model selection  Inverse probability weight  Model misspecification  Missing at random  Kullback-Leibler divergence  Robust   Application of Artificial Bee Colony Algorithm Based on Co-Evolution in Automatic Layout of Building Multiple Pipelines 会议论文  OAI收割 Guiyang, China, July 2-4, 2018 作者:  Wang, Zhe;  Wang CT(王长涛);  Han ZH(韩忠华)   |  收藏  |  浏览/下载：28/0  |  提交时间：2018/12/24 Probability selection  Initial pipeline path  Coevolution  Artificial bee colony algorithm   EMERGING BEHAVIORAL CONSENSUS OF EVOLUTIONARY DYNAMICS ON COMPLEX NETWORKS 期刊论文  OAI收割 SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2016, 卷号: 54, 期号: 6, 页码: 3258-3272 作者:  Tan, Shaolin;  Lu, Jinhu;  Lin, Zongli   |  收藏  |  浏览/下载：26/0  |  提交时间：2018/07/30 evolutionary dynamics  complex networks  consensus state selection  fixation probability   An effective DE algorithm for hybrid flow shop load balancing scheduling problem 会议论文  OAI收割 International Conference on Electronic Science and Automation Control (ESAC), Zhengzhou, PEOPLES R CHINA, Augest 15-16, 2015 作者:  Han ZH(韩忠华);  Dong XT(董晓婷);  Lin S(林硕) 收藏  |  浏览/下载：22/0  |  提交时间：2015/12/25 HFS scheduling problem  load balancing  selection probability  DE algorithm  DPSADE algorithm   基于高斯混合模型的高维数据概率密度估计 学位论文  OAI收割 工学博士, 中国科学院自动化研究所: 中国科学院研究生院, 2011 作者:  刘晓华 收藏  |  浏览/下载：334/0  |  提交时间：2015/09/02 概率密度估计  高斯混合模型  EM算法  共享子空间混合密度模型  鉴别学习  最小分类错误准则  梯度下降  模型选择  启发式交叉验证  Probability Density Estimation  Gaussian Mixture Model  EM Algoithm  Pooled Subspace Mixture Density Model  Discriminative Learning  Minimum Classification Error Criterion  Gradient Descent  Model Selection  Heuristic Cross-Validation   MARKOWITZ STRATEGIES REVISED 期刊论文  OAI收割 ACTA MATHEMATICA SCIENTIA, 2009, 卷号: 29, 期号: 4, 页码: 817-828 作者:  Yan Jia-an;  Zhou Xunyu   |  收藏  |  浏览/下载：18/0  |  提交时间：2018/07/30 continuous-time portfolio selection  Markowitz efficient strategies  goal-reaching probability  stopping time  expected loss   An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文  OAI收割 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China 作者:  Wang C. 收藏  |  浏览/下载：16/0  |  提交时间：2013/03/25 Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.   selection algorithm for anycast relay routing 会议论文  OAI收割 23rd IEEE International Performance, Computing, and Communications Conference (IPCCC 2004), Phoenix, AZ, APR 15-17, Zheng JP; Li KQ; Wu ZM   |  收藏  |  浏览/下载：16/0  |  提交时间：2011/07/29 IPv6  anycast relay routing  anycast server  probability analysis  replicated service  selection algorithms  service discovery  Internet  network servers  probability  telecommunication network routing  telecommunication services