Vés al contingut (premeu Retorn)

On exploitation vs exploration of solution space for grid scheduling

Xhafa, F.; Duran, B.; Kolodziej, J.; Barolli, L.; Takizawa, M.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
3rd IEEE International Conference on Intelligent Networking and Collaborative Systems
Any de l'edició
Data de presentació
Llibre d'actes
Third IEEE International Conference on Intelligent Networking and Collaborative Systems: Fukuoka Institute of Technology (FIT) Fukuoka, Japan, 30 November–2 December 2011: proceedings
Pàgina inicial
Pàgina final
DOI Obrir en finestra nova
URL Obrir en finestra nova
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...
Paraules clau
Combinatorial mathematics, Grid computing, Iterative methods, Optimisation, Scheduling, Search problems
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals


  • Xhafa Xhafa, Fatos  (autor ponent)
  • Duran, Bernat  (autor ponent)
  • Kolodziej, Joanna  (autor ponent)
  • Barolli, Leonard  (autor ponent)
  • Takizawa, Makoto  (autor ponent)