메뉴 건너뛰기




Volumn 40, Issue 12, 1991, Pages 1413-1418

On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems

Author keywords

Approximation algorithms; Boltzmann machine; combinatorial optimization; consensus function; feasibility; heuristic; neural network; NP complete

Indexed keywords

MATHEMATICAL PROGRAMMING, LINEAR;

EID: 0026367759     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.106226     Document Type: Article
Times cited : (24)

References (11)
  • 1
    • 0003754285 scopus 로고    scopus 로고
    • Simulated Annealing and Boltzmann Machines, A Stochastic Approach to Combinational Optimization and Neural Computing
    • New York: Wiley
    • E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines, A Stochastic Approach to Combinational Optimization and Neural Computing. New York: Wiley, 1989.
    • Aarts, E.1    Korst, J.2
  • 2
    • 0001578518 scopus 로고
    • A learning algorithm for Boltzmann machines
    • D. Ackley, G. Hinton, and T. Segnowski, “A learning algorithm for Boltzmann machines,” Cognitive Sci., vol. 9, pp. 147–169, 1985.
    • (1985) Cognitive Sci. , vol.9 , pp. 147-169
    • Ackley, D.1    Hinton, G.2    Segnowski, T.3
  • 3
    • 0342887396 scopus 로고
    • Full parallelism in Boltzmann machines
    • Nimes, Nov.
    • A. Bertoni, P. Campadelli, and F. Grassani, “Full parallelism in Boltzmann machines,” in Proc. Neuro-Nimes, pp. 361–370, Nimes, Nov. 1989.
    • (1989) Proc. Neuro-Nimes , pp. 361-370
    • Bertoni, A.1    Campadelli, P.2    Grassani, F.3
  • 4
    • 0003603813 scopus 로고    scopus 로고
    • Computers and Intractability: A Guide to the Theory of NP-Comleteness
    • San Francisco, CA: Freeman
    • R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Comleteness. San Francisco, CA: Freeman, 1979.
    • Garey, R.1    Johnson, D.S.2
  • 5
    • 0021835689 scopus 로고
    • Neural computation of decision in optimization problems
    • J.J. Hopfield and D. W. Tank, “Neural computation of decision in optimization problems,” Biol. Cybern., vol. 52, pp. 141–152, 1985.
    • (1985) Biol. Cybern. , vol.52 , pp. 141-152
    • Hopfield, J.J.1    Tank, D.W.2
  • 6
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • D. S. Johnson, “Approximation algorithms for combinatorial problems,” J. Comput. Syst. Sci., vol. 9, pp. 256–278, 1974.
    • (1974) J. Comput. Syst. Sci. , vol.9 , pp. 256-278
    • Johnson, D.S.1
  • 7
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. D. Gelatt, Jr., and M.P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–689, 1983.
    • (1983) Science , vol.220 , pp. 671-689
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 9
    • 84919265592 scopus 로고
    • A connectionist approach to vertex cover problems
    • Washington, June
    • Y. Peng, “A connectionist approach to vertex cover problems,” IJCNN, Washington, June 1989.
    • (1989) IJCNN
    • Peng, Y.1
  • 10
    • 51249185440 scopus 로고
    • On periodical behaviour in societies with symmetric influences
    • S. Poljak and M. Sura, “On periodical behaviour in societies with symmetric influences,” Combinatorica, vol. 3, no. 1, pp. 119–121, 1983.
    • (1983) Combinatorica , vol.3 , Issue.1 , pp. 119-121
    • Poljak, S.1    Sura, M.2
  • 11
    • 84941545752 scopus 로고
    • On discrete nonlinear associative memories
    • Çesme, Oct.
    • A. Stafylopatis and V. Zissimopoulos, “On discrete nonlinear associative memories,” in Proc. IV ISCIS, Çesme, Oct. 1989, pp. 625-634.
    • (1989) Proc. IV ISCIS , pp. 625-634
    • Stafylopatis, A.1    Zissimopoulos, V.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.