메뉴 건너뛰기




Volumn Part F129452, Issue , 1996, Pages 304-313

Towards an analysis of local optimization algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORESTRY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; COMBINATORIAL MATHEMATICS; GRAPH THEORY; PERFORMANCE; POLYNOMIALS; PROBABILITY; TREES (MATHEMATICS);

EID: 0029714315     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237882     Document Type: Conference Paper
Times cited : (13)

References (9)
  • 1
    • 0002103664 scopus 로고
    • On the markov chain simulation method for uniform combinatorial distributions and simulated annealing
    • D. Aldous. On the markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in the Engineering and Informational Sciences, 1:33-46, 1987.
    • (1987) Probability in the Engineering and Informational Sciences , vol.1 , pp. 33-46
    • Aldous, D.1
  • 2
    • 51249173340 scopus 로고
    • Eigenvalues and expanders
    • N. Alon. Eigenvalues and expanders. Combinatorica, 6:83-96, 1986.
    • (1986) Combinatorica , vol.6 , pp. 83-96
    • Alon, N.1
  • 4
    • 0002370076 scopus 로고
    • How hard is it to marry at random? (On the approximation of the permanent)
    • A. Z. Broder. How hard is it to marry at random? (On the approximation of the permanent). In Proc. 18th Ann. ACM Symp. on Theory of Computing, pages 50-58, 1986.
    • (1986) Proc. 18th Ann. ACM Symp. on Theory of Computing , pp. 50-58
    • Broder, A.Z.1
  • 5
    • 0000434997 scopus 로고
    • Space lower bounds for maze threadability on restricted machines
    • S. A. Cook and C. W. Rackoff. Space lower bounds for maze threadability on restricted machines. SIAM Journal on Computing, 9(4):635-652, 1980.
    • (1980) SIAM Journal on Computing , vol.9 , Issue.4 , pp. 635-652
    • Cook, S.A.1    Rackoff, C.W.2
  • 7
    • 84898957407 scopus 로고
    • Conductance and the rapid mixing property of markov chains: The approximation of the permanent resolved
    • M. R. Jerrum and A. Sinclair. Conductance and the rapid mixing property of markov chains: The approximation of the permanent resolved. In Proc. 20th ACM Symposium on Theory of Computing (STOC), pages 235-244, 1988.
    • (1988) Proc. 20th ACM Symposium on Theory of Computing (STOC) , pp. 235-244
    • Jerrum, M.R.1    Sinclair, A.2
  • 9
    • 0023999795 scopus 로고
    • The time complexity of maximum matching by simulated annealing
    • G. H. Sasaki and B. Hajek. The time complexity of maximum matching by simulated annealing. Journal ACM, 35(2):387-403, 1988.
    • (1988) Journal ACM , vol.35 , Issue.2 , pp. 387-403
    • Sasaki, G.H.1    Hajek, B.2


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