中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共3条，第1-3条

帮助

条数/页：排序方式：
	Convergence to Equilibrium in Fokker-Planck Equations 期刊论文 OAI收割 JOURNAL OF DYNAMICS AND DIFFERENTIAL EQUATIONS, 2019, 卷号: 31, 期号: 3, 页码: 1591-1615 作者: Ji, Min; Shen, Zhongwei; Yi, Yingfei \| 收藏 \| 浏览/下载：45/0 \| 提交时间：2020/01/10 Fokker-Planck equation Probability solutions Convergence
	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. 收藏 \| 浏览/下载：14/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.
	On the probability of the number of solutiong for the P4P problem 期刊论文 OAI收割 JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2006, 卷号: 25, 期号: 1, 页码: 79-86 作者: Gao, Xiao-Shan; Tang, Jianliang \| 收藏 \| 浏览/下载：18/0 \| 提交时间：2018/07/30 camera calibration pose determination perspective four point problem P4P probability number of solutions