메뉴 건너뛰기




Volumn 15, Issue , 2011, Pages 3341-3345

Optimization of cloud database route scheduling based on combination of genetic algorithm and ant colony algorithm

Author keywords

Ant colony algorithm; Cloud database; Dynamic routing scheduling; Genetic algorithm

Indexed keywords

ANT COLONY ALGORITHMS; CLOUD DATABASE; DYNAMIC COMBINATION; GENETIC CONTROL; INITIAL SOLUTION; INITIAL VALUES; OPTIMAL SOLUTIONS; SCHEDULING PROBLEM;

EID: 84055224102     PISSN: 18777058     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.proeng.2011.08.626     Document Type: Conference Paper
Times cited : (28)

References (9)
  • 1
    • 80054936498 scopus 로고    scopus 로고
    • Cloud database dynamic route scheduling based on ant colony optimization algorithm[J]
    • Shi HL, Bai GY, Tang ZM, et al. Cloud database dynamic route scheduling based on ant colony optimization algorithm[J]. Computer Science, 2010, 37 (5): 143-145.
    • (2010) Computer Science , vol.37 , Issue.5 , pp. 143-145
    • Shi, H.L.1    Bai, G.Y.2    Tang, Z.M.3
  • 2
    • 20444424172 scopus 로고    scopus 로고
    • Hardware/software partitioning based on dynamic combination of genetic algorithm and ant algorithm[J]
    • Xiong ZH, Li SK, Chen JH. Hardware/Software partitioning based on dynamic combination of genetic algorithm and ant algorithm[J]. Journal of Software, 2005, 16 (4): 503-512.
    • (2005) Journal of Software , vol.16 , Issue.4 , pp. 503-512
    • Xiong, Z.H.1    Li, S.K.2    Chen, J.H.3
  • 6
    • 0030302513 scopus 로고    scopus 로고
    • A note on least time path computation considering delays and prohibitions for intersection movements[J]
    • Athanasiosk. Ziliaskopoulos, Hanis Mahmassani. A note on least time path computation considering delays and prohibitions for intersection movements[J]. Transportation Res-B, 1996, 30 (5): 359-366.
    • (1996) Transportation Res-b , vol.30 , Issue.5 , pp. 359-366
    • Athanasiosk, Z.1    Hanis, M.2
  • 8
    • 4544242894 scopus 로고    scopus 로고
    • The parameterized complexity of counting problems[J]
    • Flum J, Grohe M, The parameterized complexity of counting problems[J]. SIAM Journal on Computing, 2004, 33(4): 892-922.
    • (2004) SIAM Journal on Computing , vol.33 , Issue.4 , pp. 892-922
    • Flum, J.1    Grohe, M.2


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