机构

• 理论物理研究所 [7]
• 长春光学精密机械与物... [2]
• 物理研究所 [1]
• 数学与系统科学研究院 [1]

采集方式

• OAI收割 [11]

内容类型

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

发表日期

• 2016 [1]
• 2013 [2]
• 2011 [1]
• 2010 [3]
• 2009 [3]
• 2008 [1]
• 更多

学科主题

• Physics [6]

筛选

浏览/检索结果: 共11条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Performances of pure random walk algorithms on constraint satisfaction problems with growing domains 期刊论文  OAI收割 JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 卷号: 32, 期号: 1, 页码: 51-66 作者:  Xu, Wei;  Gong, Fuzhou   |  收藏  |  浏览/下载：15/0  |  提交时间：2018/07/30 Constraint satisfaction problems  Model RB  Random walk  Local search algorithms   Solution Space Coupling in the Random K-Satisfiability Problem 期刊论文  OAI收割 COMMUNICATIONS IN THEORETICAL PHYSICS, 2013, 卷号: 60, 期号: 3, 页码: 363-374 作者:  Zhou, HJ 收藏  |  浏览/下载：27/0  |  提交时间：2014/04/25 CONSTRAINT SATISFACTION PROBLEMS  GLASS-TRANSITION  ENTROPY   Witness of unsatisfiability for a random 3-satisfiability formula 期刊论文  OAI收割 PHYSICAL REVIEW E, 2013, 卷号: 87, 期号: 5, 页码: 52807 作者:  Zhou, HJ 收藏  |  浏览/下载：27/0  |  提交时间：2014/04/25 CONSTRAINT SATISFACTION PROBLEMS  RANDOM K-SAT  SATISFIABILITY PROBLEMS  CAVITY METHOD   Approaching the ground states of the random maximum two-satisfiability problem by a greedy single-spin flipping process 期刊论文  OAI收割 PHYSICAL REVIEW E, 2011, 卷号: 83, 期号: 5, 页码: 52101 作者:  Zhou, HJ 收藏  |  浏览/下载：16/0  |  提交时间：2013/05/17 CONSTRAINT SATISFACTION PROBLEMS  SATISFIABILITY PROBLEMS  CAVITY METHOD  OPTIMIZATION   Learning by random walks in the weight space of the Ising perceptron 期刊论文  OAI收割 JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2010, 期号: 75, 页码: - 作者:     |  收藏  |  浏览/下载：80/0  |  提交时间：2012/08/02 Constraint Satisfaction Problems  Neural Network Models  Binary Perceptron  Storage Capacity  Synapses  Algorithm  Couplings  Plasticity  Dynamics   Learning by random walks in the weight space of the Ising perceptron 期刊论文  OAI收割 JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2010 Huang, HP; Zhou, HJ 收藏  |  浏览/下载：23/0  |  提交时间：2013/09/18 CONSTRAINT SATISFACTION PROBLEMS  NEURAL NETWORK MODELS  BINARY PERCEPTRON  STORAGE CAPACITY  SYNAPSES  ALGORITHM  COUPLINGS  PLASTICITY  DYNAMICS   Solution space heterogeneity of the random K-satisfiability problem: Theory and simulations 会议论文  OAI收割 Kyoto Univ, Kyoto, JAPAN, MAR 07-10, 2010 作者:  Zhou, HJ   |  收藏  |  浏览/下载：12/0  |  提交时间：2019/07/24 CONSTRAINT SATISFACTION PROBLEMS  SPIN-GLASSES  MEAN-FIELD  DYNAMICS  LIQUIDS  STATES   Communities of solutions in single solution clusters of a random K-satisfiability formula 期刊论文  OAI收割 PHYSICAL REVIEW E, 2009, 卷号: 80, 期号: 6, 页码: - 作者:  Zhou, Haijun;  Ma, Hui;  Zhou, HJ , Chinese Acad Sci, Key Lab Frontiers Theoret Phys, Beijing 100190, Peoples R China   |  收藏  |  浏览/下载：20/0  |  提交时间：2012/08/02 Constraint Satisfaction Problems  Phase   From one solution of a 3-satisfiability formula to a solution cluster: Frozen variables and entropy 期刊论文  OAI收割 PHYSICAL REVIEW E, 2009, 卷号: 79, 期号: 3, 页码: - 作者:  Li, K , Chinese Acad Sci, Inst Theoret Phys, Beijing 100190, Peoples R China;  Li, Kang;  Ma, Hui;  Zhou, Haijun   |  收藏  |  浏览/下载：18/0  |  提交时间：2012/08/02 Constraint Satisfaction Problems  Random Satisfiability Problems  Message-passing Algorithms  Computational-complexity  Glass-transition   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.