机构

• 长春光学精密机械与物... [2]
• 计算技术研究所 [1]
• 数学与系统科学研究院 [1]
• 软件研究所 [1]

采集方式

• OAI收割 [5]

内容类型

• 期刊论文 [3]
• 会议论文 [2]

发表日期

• 2020 [1]
• 2009 [2]
• 2008 [1]
• 1999 [1]

学科主题

• Artificial... [1]
• Computer S... [1]
• Interdisci... [1]

筛选

浏览/检索结果: 共5条，第1-5条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序作者升序作者降序 Clustering phase of a general constraint satisfaction problem model d-k-CSP 期刊论文  OAI收割 PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 卷号: 537, 页码: 15 作者:  Xu, Wei;  Gong, Fuzhou;  Zhou, Guangyan   |  收藏  |  浏览/下载：69/0  |  提交时间：2020/05/24 Constraint satisfaction problem  Solution space structure  Clustering phase transition  Problem hardness  Belief propagation   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.   a-team based supply chain management agent architecture 期刊论文  OAI收割 INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2009, 卷号: 18, 期号: 6, 页码: 801-823 Zheng Yujun; Wang Jinquan; Xue Jinyun   |  收藏  |  浏览/下载：28/0  |  提交时间：2011/03/18 Agent  supply chain management (SCM)  architecture  asynchronous team (A-Team)  constraint satisfaction  problem solving  evolution   A comparative study of discrete differential evolution on binary constraint satisfaction problems (EI CONFERENCE) 会议论文  OAI收割 2008 IEEE Congress on Evolutionary Computation, CEC 2008, June 1, 2008 - June 6, 2008, Hong Kong, China Yang Q. 收藏  |  浏览/下载：72/0  |  提交时间：2013/03/25 There are some variants and applications of the discretization of differential evolution. Performances of discrete differential evolution algorithms on random binary constraint satisfaction problem are studied in this paper  and a novel discrete differential evolution algorithm based on exchanging elements is proposed. We compare the proposed discrete differential evolution  evolutionary algorithms and discrete particle swarm optimization on random binary constraint satisfaction problems. Experimental results indicate though the proposed algorithm is simpler  it is competitive with other evolutionary algorithms solving constraint satisfaction problems. 2008 IEEE.   Polynomial algorithm of limited propositional deduction 期刊论文  OAI收割 SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1999, 卷号: 42, 期号: 4, 页码: 418-424 作者:  Shi, ZZ;  Liao, LJ   |  收藏  |  浏览/下载：16/0  |  提交时间：2019/12/16 limited propositional deduction  polynomial algorithm  problem of propositional satisfiability  constraint satisfaction problem