메뉴 건너뛰기




Volumn 2, Issue , 2002, Pages 1540-1545

A scalable and robust framework for distributed applications

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS;

EID: 84901429889     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1004471     Document Type: Conference Paper
Times cited : (19)

References (16)
  • 2
    • 84903647207 scopus 로고    scopus 로고
    • Napster, "http://napster.com/"
    • Napster
  • 3
    • 84903565332 scopus 로고    scopus 로고
    • United Devicestm
    • United Devicestm, "http://ud.com/,".
  • 5
    • 84903565324 scopus 로고    scopus 로고
    • Gnutella, "http://gnutella.wego.com/"
  • 6
  • 7
    • 84903565325 scopus 로고    scopus 로고
    • distributed.net
    • distributed.net, "http://distributed.net/"
  • 8
    • 84903565326 scopus 로고    scopus 로고
    • SETI@thome
    • SETI@home, "http://setiathome.ssl.berkeley.edu/"
  • 10
    • 0001722513 scopus 로고    scopus 로고
    • Stochastic hiliclimbing as a baseline method for evaluating genetic algorithms
    • David S. Touretzky, Michael C. Mozer, and Michael E. Hasselmo, Eds
    • Ari Juels and Martin Wattenberg, "Stochastic hiliclimbing as a baseline method for evaluating genetic algorithms, " in Advances in Neural Infor mation Processing Systems, David S. Touretzky, Michael C. Mozer, and Michael E. Hasselmo, Eds. 1996, vol. 8, pp. 430-436, The MIT Press.
    • (1996) Advances in Neural Infor Mation Processing Systems , vol.8 , pp. 430-436
    • Juels, A.1    Wattenberg, M.2
  • 14
    • 33846200465 scopus 로고
    • Lattice basis reduction: Improved practial algorithms and solving subset sum problems
    • Claus-Peter Schnorr and M. Euchner, "Lattice basis reduction: Improved practial algorithms and solving subset sum problems, " Mathematical Programming, vol. 66, pp. 181-191, 1994.
    • (1994) Mathematical Programming , vol.66 , pp. 181-191
    • Schnorr, C.-P.1    Euchner, M.2


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