In this paper we propose an approach to solve multiprocessor scheduling problem with use of rule-based learning machine - Learning Classifier System (LCS). LCS combines reinforcement learning and evolutionary computing to produce adaptive systems. We interpret the multiprocessor scheduling problem as multi-step problem, where a feedback is given after some number steps. We show that LCS is able to solve scheduling tasks of a parallel program in the two processor system.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Learning Classifier Systems (LCSs) have gained increasing interest in the genetic and evolutionary computation literature. Many real-world problems are not conveniently expressed using the ternary representation typically used by LCSs and for such problems an interval-based representation is preferable. A new model of LCSs is introduced to classify realvalued data. The approach applies the continous-valued context-free grammar-based system GCS. In order to handle data effectively, the terminal rules were replaced by the so-called environment probing rules. The rGCS model was tested on the checkerboard problem.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.