Loading...
Loading...

Go to the content (press return)

On exploitation vs exploration of solution space for grid scheduling

Author
Xhafa, F.; Duran, B.; Kolodziej, J.; Barolli, L.; Takizawa, M.
Type of activity
Presentation of work at congresses
Name of edition
3rd IEEE International Conference on Intelligent Networking and Collaborative Systems
Date of publication
2011
Presentation's date
2011-12
Book of congress proceedings
Third IEEE International Conference on Intelligent Networking and Collaborative Systems: Fukuoka Institute of Technology (FIT) Fukuoka, Japan, 30 November–2 December 2011: proceedings
First page
164
Last page
171
DOI
https://doi.org/10.1109/INCoS.2011.128 Open in new window
URL
https://ieeexplore.ieee.org/document/6132794/ Open in new window
Abstract
Finding an optimal solution is computationally hard for most combinatorial optimization problems. Therefore the use of heuristics methods aims at finding, if not optimal, near optimal solutions in reasonable amount of computation time. Due to lack of knowledge about the landscape of fitness function, searching the solution space by heuristic methods becomes very challenging. One can search the solution space through a path of feasible solutions, in which the search method manages one solution at...
Keywords
Combinatorial mathematics, Grid computing, Iterative methods, Optimisation, Scheduling, Search problems
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

  • Xhafa Xhafa, Fatos  (author and speaker )
  • Duran, Bernat  (author and speaker )
  • Kolodziej, Joanna  (author and speaker )
  • Barolli, Leonard  (author and speaker )
  • Takizawa, Makoto  (author and speaker )