Using a Neural Network with Nonlinear Self-feedback to Solve the Maximum Clique Problem
CSTR:
Author:
Affiliation:

Clc Number:

TP183

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    As the MCP is NP-hard, an efficient approach to treating this problem is to design appropriate recurrent neural networks. We develop a new algorithm for the MCP, which can, to a certain extent, prevent the associated neural network from falling into local optimal points. The proposed algorithm incorporates nonlinear self-feedback into the SLDN algorithm and has distinguished dynamical characteristics. Simulation results show that the performance of proposed algorithm is statistically superior to the SLDN algorithm.

    Reference
    Related
    Cited by
Get Citation

刘怀义,杨小帆,孙丽萍,司沛,王灿.用带非线性自反馈的神经网络求解最大团问题[J].重庆大学学报,2007,30(9):60~63

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:May 16,2007
  • Adopted:
  • Online:
  • Published:
Article QR Code