Distributed scheduling using simple learning machines

DOI10.1016/S0377-2217(97)00342-1zbMath0943.90040OpenAlexW2065751271MaRDI QIDQ1296102

Franciszek Seredyński

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00342-1

zbMATH Keywords

schedulingparallel processinggame theoretical modeladaptive processesclassifier systemsdistributed artificial intelligencegenetic-algorithms based learning machines

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications ⋮ A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network

Cites Work

• Unnamed Item
• Unnamed Item
• Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
• A comparison of list schedules for parallel processing systems

This page was built for publication: Distributed scheduling using simple learning machines