Title
A Genetic Approach To Planning In Heterogeneous Computing Environments
Abstract
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search methods often used to solve complex optimization problems. In this paper, we propose a genetic approach to planning in the context of workflow management and process coordination on a heterogenous grid. We report results for two planning problems, the Towers of Hanoi and the Sliding-tile puzzle.
Publication Date
1-1-2003
Publication Title
Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/IPDPS.2003.1213199
Copyright Status
Unknown
Socpus ID
84947209330 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/84947209330
STARS Citation
Yu, Han; Marinescu, Dan C.; and Wu, Annie S., "A Genetic Approach To Planning In Heterogeneous Computing Environments" (2003). Scopus Export 2000s. 1944.
https://stars.library.ucf.edu/scopus2000/1944