Near-Optimal Solutions for the Minimum Cost Spare Allocation Problem using Hopfield-T ype Neural Network Optimizers 1
暂无分享,去创建一个
[1] Michail G. Lagoudakis. An IDA algorithm for optimal spare allocation , 1999, SAC '99.
[2] J J Hopfield,et al. Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.
[3] Carsten Peterson,et al. Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem , 1993, Neural Computation.
[4] Anders Krogh,et al. Introduction to the theory of neural computation , 1994, The advanced book program.
[5] George Papageorgiou,et al. A hybrid neural optimization scheme based on parallel updates , 1998, Int. J. Comput. Math..
[6] Yoshiyasu Takefuji,et al. Neural computing for optimization and combinatorics , 1996 .
[7] W. Kent Fuchs,et al. Efficient Spare Allocation in Reconfigurable Arrays , 1986, 23rd ACM/IEEE Design Automation Conference.
[8] J. Hopfield,et al. Computing with neural circuits: a model. , 1986, Science.
[9] Y. Takefuji,et al. Design of parallel distributed Cauchy machines , 1989, International 1989 Joint Conference on Neural Networks.
[10] Andrzej Cichocki,et al. Neural networks for optimization and signal processing , 1993 .
[11] Stefen Hui,et al. On solving constrained optimization problems with neural networks: a penalty method approach , 1993, IEEE Trans. Neural Networks.
[12] Geoffrey E. Hinton,et al. A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..
[13] George Papageorgiou,et al. A parallelizable operation scheme of the Boltzmann machine optimizer based on group updates , 1995, Neural Parallel Sci. Comput..