机构

• 数学与系统科学研究院 [2]
• 地理科学与资源研究所 [1]
• 长春光学精密机械与物... [1]
• 自动化研究所 [1]
• 国家授时中心 [1]

采集方式

• OAI收割 [6]

内容类型

• 期刊论文 [4]
• EI期刊论文 [1]
• 会议论文 [1]

发表日期

• 2021 [2]
• 2017 [1]
• 2009 [1]
• 2006 [1]
• 2005 [1]

学科主题

筛选

浏览/检索结果: 共6条，第1-6条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Determination and estimation of optimal quarantine duration for infectious diseases with application to data analysis of COVID-19 期刊论文  OAI收割 BIOMETRICS, 2021, 页码: 10 作者:  Wang, Ruoyu;  Wang, Qihua   |  收藏  |  浏览/下载：44/0  |  提交时间：2021/04/26 incubation period  kernel estimation  maximum likelihood  optimal solution  probability constraint  statistical modeling   Constant Envelope Multiplexing of Multi-Carrier DSSS Signals Considering Sub-Carrier Frequency Constraint 期刊论文  OAI收割 ELECTRONICS, 2021, 卷号: 10, 期号: 2, 页码: 16 作者:  Chen, Xiaofei;  Lu, Xiaochun;  Wang, Xue;  Ke, Jing;  Guo, Xia   |  收藏  |  浏览/下载：15/0  |  提交时间：2021/11/29 multi-carrier  constant envelope multiplexing  frequency constraint  signal states probability  homogeneous equations   An efficient stochastic approach for robust time-optimal trajectory planning of robotic manipulators under limited actuation 期刊论文  OAI收割 ROBOTICA, 2017, 卷号: 35, 期号: 12, 页码: 2400-2417 作者:  Zhao, Ming-Yong;  Gao, Xiao-Shan;  Zhang, Qiang   |  收藏  |  浏览/下载：32/0  |  提交时间：2018/07/30 Robust trajectory planning  Robotic manipulators  Stochastic optimization  Probability constraint  Linear programming   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. 收藏  |  浏览/下载：15/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.   Minimum entropy of B-spline PDF systems with mean constraint 期刊论文  OAI收割 AUTOMATICA, 2006, 卷号: 42, 期号: 6, 页码: 989-994 作者:  Yue, H;  Zhou, JL;  Wang, H 收藏  |  浏览/下载：20/0  |  提交时间：2015/11/07 continuous distribution  probability density function (PDF)  B-spline  minimum entropy  mean constraint   An artificial-neural-network-based, constrained CA model for simulating urban growth EI期刊论文  OAI收割 2005 作者:  Wang Liming 收藏  |  浏览/下载：100/0  |  提交时间：2012/06/11 Backpropagation  Computer simulation  Constraint theory  Economics  Forecasting  Mathematical models  Neural networks  Probability  Urban planning