Evolution Strategies on Desktop Grid Environment Using Scheduling Algorithms RR for Same Length Tasks

  • Yoshiyuki Matsumura
  • Noriyuki Fujimoto
  • Xin Yao
  • Yoshikazu Murayama
  • Kenichi Hagihara
Conference paper

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Fujimoto and K. Hagihara (2003), “Near-Optimal Dynamic Task Scheduling of Independent Coarse-Grained Tasks onto a Computational Grid,” Proceedings of the 32nd Annual International Conference on Parallel Processing (ICPP-03)Google Scholar
  2. 2.
    Y. Matsumura, X. Yao, J. Wyatt, K. Ohkura and K. Ueda (2003), “Robust Evolution Strategies Use Adaptive Search Strategies to Design the Continuous-Time Recurrent Neural Networks,” Proceedings of 2nd International Conference on Computational Intelligence, Robotics and Autonomous Systems (CIRAS 2003)Google Scholar
  3. 3.
    X. Yao and Y. Liu (1997), “Fast Evolution Strategies,” Control and Cybernetics, Vol. 26, No. 3, pp.467-496MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Yoshiyuki Matsumura
    • 1
  • Noriyuki Fujimoto
    • 2
  • Xin Yao
    • 3
  • Yoshikazu Murayama
    • 4
  • Kenichi Hagihara
    • 5
  1. 1.University of BirminghamBirminghamUK
  2. 2.Graduate School of Information Science and TechnologyOsaka UniversityOsakaJapan
  3. 3.University of BirminghamBirminghamUK
  4. 4.University of BirminghamBirminghamUK
  5. 5.Graduate School of Information Science and TechnologyOsaka UniversityOsakaJapan

Personalised recommendations