138 related articles for article (PubMed ID: 18282836)
1. Graph partitioning using annealed neural networks.
Van den Bout DE; Miller TK
IEEE Trans Neural Netw; 1990; 1(2):192-203. PubMed ID: 18282836
[TBL] [Abstract][Full Text] [Related]
2. An approximation algorithm for graph partitioning via deterministic annealing neural network.
Wu Z; Karimi HR; Dang C
Neural Netw; 2019 Sep; 117():191-200. PubMed ID: 31174047
[TBL] [Abstract][Full Text] [Related]
3. Paralleled hardware annealing for optimal solutions on electronic neural networks.
Lee BW; Sheu BJ
IEEE Trans Neural Netw; 1993; 4(4):588-99. PubMed ID: 18267760
[TBL] [Abstract][Full Text] [Related]
4. A fast neural-network algorithm for VLSI cell placement.
Aykanat C; Bultan T; Haritaoğlu I
Neural Netw; 1998 Dec; 11(9):1671-1684. PubMed ID: 12662737
[TBL] [Abstract][Full Text] [Related]
5. Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers.
Li SZ
IEEE Trans Neural Netw; 1996; 7(6):1507-16. PubMed ID: 18263545
[TBL] [Abstract][Full Text] [Related]
6. Scheduling multiprocessor job with resource and timing constraints using neural networks.
Huang YM; Chen RM
IEEE Trans Syst Man Cybern B Cybern; 1999; 29(4):490-502. PubMed ID: 18252324
[TBL] [Abstract][Full Text] [Related]
7. Cooperative updating in the Hopfield model.
Munehisa T; Kobayashi M; Yamazaki H
IEEE Trans Neural Netw; 2001; 12(5):1243-51. PubMed ID: 18249951
[TBL] [Abstract][Full Text] [Related]
8. Combinatorial optimization by weight annealing in memristive hopfield networks.
Fahimi Z; Mahmoodi MR; Nili H; Polishchuk V; Strukov DB
Sci Rep; 2021 Aug; 11(1):16383. PubMed ID: 34385475
[TBL] [Abstract][Full Text] [Related]
9. Mean field annealing: a formalism for constructing GNC-like algorithms.
Bilbro GL; Snyder WE; Garnier SJ; Gault JW
IEEE Trans Neural Netw; 1992; 3(1):131-8. PubMed ID: 18276414
[TBL] [Abstract][Full Text] [Related]
10. A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks.
He H; Zhu Z; Mäkinen E
IEEE Trans Neural Netw; 2009 Jun; 20(6):973-82. PubMed ID: 19398401
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. An improved neural network model for the two-page crossing number problem.
He H; Sýkora O; Mäkinen E
IEEE Trans Neural Netw; 2006 Nov; 17(6):1642-6. PubMed ID: 17131678
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Comparison of simulated annealing and mean field annealing as applied to the generation of block designs.
Bofill P; Guimerà R; Torras C
Neural Netw; 2003 Dec; 16(10):1421-8. PubMed ID: 14622874
[TBL] [Abstract][Full Text] [Related]
15. Self-organizing and self-evolving neurons: a new neural network for optimization.
Wu S; Chow TW
IEEE Trans Neural Netw; 2007 Mar; 18(2):385-96. PubMed ID: 17385627
[TBL] [Abstract][Full Text] [Related]
16. A Graph Partition-Based Large-Scale Distribution Network Reconfiguration Method.
Sha Y
Comput Intell Neurosci; 2022; 2022():3169065. PubMed ID: 35321458
[TBL] [Abstract][Full Text] [Related]
17. Design and analysis of maximum Hopfield networks.
Galán-Marín G; Muñoz-Pérez J
IEEE Trans Neural Netw; 2001; 12(2):329-39. PubMed ID: 18244387
[TBL] [Abstract][Full Text] [Related]
18. Accuracy criterion for the mean-field approximation in susceptible-infected-susceptible epidemics on networks.
Van Mieghem P; van de Bovenkamp R
Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Mar; 91(3):032812. PubMed ID: 25871162
[TBL] [Abstract][Full Text] [Related]
19. Reconstructing the Hopfield network as an inverse Ising problem.
Huang H
Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Mar; 81(3 Pt 2):036104. PubMed ID: 20365812
[TBL] [Abstract][Full Text] [Related]
20. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
Dang C; Ma W; Liang J
Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
