Cellular neural networks for NP-hard optimization

被引:0
|
作者
Ercsey-Ravasz, Maria [1 ]
Roska, Tamas [1 ]
Neda, Zoltan [2 ]
机构
[1] Peter Pazmany Catholic Univ, Fac Informat Technol, HU-1083 Budapest, Hungary
[2] Univ Babes Bolyai, Fac Phys, RO-400084 Cluj Napoca, Romania
关键词
D O I
10.1109/CNNA.2008.4588649
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We prove, that a CNN in which the parameters of all cells can be separately controlled, is the analog correspondent of a two-dimensional Ising type (Edwards-Anderson) spin-glass system. Using the properties of CNN we show that one single operation (template) always yields a local minimum of the spin-glass energy function. This way a very fast optimization method, similar to simulated annealing, can be built. Estimating the simulation time needed with our optimization algorithm on CNN based computers, and comparing it with the time needed on normal digital computers using the simulated annealing algorithm, the results are astonishing: CNN computers could be faster than digital computers already at 10 x 10 lattice sizes. The local control of the template parameters was already partially realized on some of the hardwares, we think this study could further motivate their development in this direction.
引用
收藏
页码:52 / +
页数:2
相关论文
共 50 条
  • [21] Terrain Guarding is NP-Hard
    King, James
    Krohn, Erik
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1580 - +
  • [22] STORAGE ALLOCATION IS NP-HARD
    ROBSON, JM
    INFORMATION PROCESSING LETTERS, 1980, 11 (03) : 119 - 125
  • [23] Automating Resolution is NP-Hard
    Atserias, Albert
    Muller, Moritz
    JOURNAL OF THE ACM, 2020, 67 (05)
  • [24] Protein design is NP-hard
    Pierce, NA
    Winfree, E
    PROTEIN ENGINEERING, 2002, 15 (10): : 779 - 782
  • [25] Comparing Problem Solving Strategies for NP-hard Optimization Problems
    Hidalgo-Herrero, Mercedes
    Rabanal, Pablo
    Rodriguez, Ismael
    Rubio, Fernando
    FUNDAMENTA INFORMATICAE, 2013, 124 (1-2) : 1 - 25
  • [26] INFLATING BALLS IS NP-HARD
    Batog, Guillaume
    Goaoc, Xavier
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (04) : 403 - 415
  • [27] Unshuffling a square is NP-hard
    Buss, Sam
    Soltys, Michael
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (04) : 766 - 776
  • [28] Can Biological Quantum Networks Solve NP-Hard Problems?
    Wendin, Goran
    ADVANCED QUANTUM TECHNOLOGIES, 2019, 2 (7-8)
  • [29] Approximation schemes for NP-hard geometric optimization problems: a survey
    Sanjeev Arora
    Mathematical Programming, 2003, 97 : 43 - 69
  • [30] Dilemma First Search for Effortless Optimization of NP-hard Problems
    Weissenberg, Julien
    Riemenschneider, Hayko
    Dragon, Ralf
    Van Gool, Luc
    2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2016, : 4154 - 4159