메뉴 건너뛰기




Volumn 1416, Issue , 1998, Pages 56-65

A fast and efficient solution to the capacity assignment problem using discretized learning automata

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMBINATORIAL OPTIMIZATION; EXPERT SYSTEMS; HEURISTIC METHODS; SIMULATED ANNEALING;

EID: 84958036330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64574-8_391     Document Type: Conference Paper
Times cited : (5)

References (13)
  • 7
    • 0017489535 scopus 로고
    • Discrete Link Capacity and Priority Assignments in Communication Networks
    • May
    • Maruyama, K„ and Tang, D. T., "Discrete Link Capacity and Priority Assignments in Communication Networks”, IBM J. Res. Develop., May 1977, pp. 254-263.
    • (1977) IBM J. Res. Develop , pp. 254-263
    • Maruyama, K.1    Tang, D.T.2
  • 10
    • 0023833454 scopus 로고
    • "Deterministic Learning Automata Solutions to the Equi-Partitioning Problem"
    • Oommen, B. J., and Ma, D. C. Y,, "Deterministic Learning Automata Solutions to the Equi-Partitioning Problem", IEEE Trans. Com.., Vol. 37, 1988, pp 2-14.
    • (1988) IEEE Trans. Com , vol.37 , pp. 2-14
    • Oommen, B.J.1    Ma, D.2


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