106 related articles for article (PubMed ID: 15714605)
1. An improved transiently chaotic neural network for the maximum independent set problem.
Xu X; Tang Z; Wang J
Int J Neural Syst; 2004 Dec; 14(6):381-92. PubMed ID: 15714605
[TBL] [Abstract][Full Text] [Related]
2. A flexible annealing chaotic neural network to maximum clique problem.
Yang G; Tang Z; Zhang Z; Zhu Y
Int J Neural Syst; 2007 Jun; 17(3):183-92. PubMed ID: 17640099
[TBL] [Abstract][Full Text] [Related]
3. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning.
Wang RL; Tang Z; Cao QP
Neural Comput; 2003 Jul; 15(7):1605-19. PubMed ID: 12816568
[TBL] [Abstract][Full Text] [Related]
4. An annealed chaotic maximum neural network for bipartite subgraph problem.
Wang J; Tang Z; Wang R
Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
[TBL] [Abstract][Full Text] [Related]
5. Chaotic simulated annealing by a neural network with a variable delay: design and application.
Chen SS
IEEE Trans Neural Netw; 2011 Oct; 22(10):1557-65. PubMed ID: 21843986
[TBL] [Abstract][Full Text] [Related]
6. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
Guturu P; Dantu R
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
[TBL] [Abstract][Full Text] [Related]
7. An approach to improve Wang-Smith chaotic simulated annealing.
Zheng L; Wang K; Tian K
Int J Neural Syst; 2002 Oct; 12(5):363-8. PubMed ID: 12424807
[TBL] [Abstract][Full Text] [Related]
8. A solution for two-dimensional mazes with use of chaotic dynamics in a recurrent neural network model.
Suemitsu Y; Nara S
Neural Comput; 2004 Sep; 16(9):1943-57. PubMed ID: 15265329
[TBL] [Abstract][Full Text] [Related]
9. Payoff-monotonic game dynamics and the maximum clique problem.
Pelillo M; Torsello A
Neural Comput; 2006 May; 18(5):1215-58. PubMed ID: 16595063
[TBL] [Abstract][Full Text] [Related]
10. The simultaneous recurrent neural network for addressing the scaling problem in static optimization.
Serpen G; Patwardhan A; Geib J
Int J Neural Syst; 2001 Oct; 11(5):477-87. PubMed ID: 11709814
[TBL] [Abstract][Full Text] [Related]
11. Application of neural network to humanoid robots-development of co-associative memory model.
Itoh K; Miwa H; Takanobu H; Takanishi A
Neural Netw; 2005; 18(5-6):666-73. PubMed ID: 16109473
[TBL] [Abstract][Full Text] [Related]
12. Multi-layered greedy network-growing algorithm: extension of greedy network-growing algorithm to multi-layered networks.
Kamimura R
Int J Neural Syst; 2004 Feb; 14(1):9-26. PubMed ID: 15034944
[TBL] [Abstract][Full Text] [Related]
13. A delayed neural network method for solving convex optimization problems.
Yang Y; Cao J
Int J Neural Syst; 2006 Aug; 16(4):295-303. PubMed ID: 16972317
[TBL] [Abstract][Full Text] [Related]
14. A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.
Wang L; Li S; Tian F; Fu X
IEEE Trans Syst Man Cybern B Cybern; 2004 Oct; 34(5):2119-25. PubMed ID: 15503507
[TBL] [Abstract][Full Text] [Related]
15. Lee-Associator-a chaotic auto-associative network for progressive memory recalling.
Lee RS
Neural Netw; 2006 Jun; 19(5):644-66. PubMed ID: 16352418
[TBL] [Abstract][Full Text] [Related]
16. Controlling chaos in a chaotic neural network.
He G; Cao Z; Zhu P; Ogura H
Neural Netw; 2003 Oct; 16(8):1195-200. PubMed ID: 13678622
[TBL] [Abstract][Full Text] [Related]
17. Novel synchronization of discrete-time chaotic systems using neural network observer.
Naghavi SV; Safavi AA
Chaos; 2008 Sep; 18(3):033110. PubMed ID: 19045448
[TBL] [Abstract][Full Text] [Related]
18. A cooperative recurrent neural network for solving L(1) estimation problems with general linear constraints.
Xia Y; Kamel MS
Neural Comput; 2008 Mar; 20(3):844-72. PubMed ID: 18370841
[TBL] [Abstract][Full Text] [Related]
19. Greedy rule generation from discrete data and its use in neural network rule extraction.
Odajima K; Hayashi Y; Tianxia G; Setiono R
Neural Netw; 2008 Sep; 21(7):1020-8. PubMed ID: 18442894
[TBL] [Abstract][Full Text] [Related]
20. Pruning artificial neural networks using neural complexity measures.
Jorgensen TD; Haynes BP; Norlund CC
Int J Neural Syst; 2008 Oct; 18(5):389-403. PubMed ID: 18991362
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
