An Improved Transiently Chaotic Neural Network with Multiple Chaotic Dynamics for Maximum Clique Problem

@article{Yang2007AnIT,
  title={An Improved Transiently Chaotic Neural Network with Multiple Chaotic Dynamics for Maximum Clique Problem},
  author={Gang Yang and Junyan Yi and Shangce Gao and Zheng Tang},
  journal={Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007)},
  year={2007},
  pages={275-275}
}
By analyzing the dynamics behaviors and parameter distribution of transiently chaotic neural network, we propose an improved transiently neural network model with new embedded back-end chaotic dynamics for combinatorial optimization problem and test it on the maximum clique problem. With the new embedded back- end chaotic dynamics, our proposed model can get enough chaotic dynamics to do global and local search, which makes the network success in escaping local minima and converging completely… CONTINUE READING
1 Citations
11 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems

  • Nobuo Funabiki, Seishi Nishikawa
  • IEICE Trans. Fundamentals, Vol. E79-A,
  • 1996
Highly Influential
4 Excerpts

Chaotic annealing for optimization

  • C. S. Zhou, T. L. Chen
  • Phys. Rev. E 55 (3).pp. 2580-2587
  • 1997
1 Excerpt

and R

  • A. Jagota, L. Sanchis
  • Ganesan, "Approximately solving maximum clique…
  • 1996
1 Excerpt

K.Lee and H.Aiso, “An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain

  • Y. Takefuji
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…