Lingua: Inglese
Editore: Südwestdeutscher Verlag für Hochschulschriften, 2009
ISBN 10: 3838110366 ISBN 13: 9783838110363
Da: preigu, Osnabrück, Germania
EUR 79,90
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Learning in Cooperative Multi-Agent Systems | Distributed Reinforcement Learning Algorithms and their Application to Scheduling Problems | Thomas Gabel | Taschenbuch | 192 S. | Deutsch | 2009 | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838110363 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Lingua: Inglese
Editore: Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG Mai 2017, 2017
ISBN 10: 3838110366 ISBN 13: 9783838110363
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 79,90
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In a distributed system, a number of individually acting agents coexist. In order to achieve a common goal, coordinated cooperation between the agents is crucial. Many real-world applications are well-suited to be formulated in terms of spatially or functionally distributed entities. Job-shop scheduling represents one such application. Multi-agent reinforcement learning (RL) methods allow for automatically acquiring cooperative policies based solely on a specification of the desired joint behavior of the whole system. However, the decentralization of the control and observation of the system among independent agents has a significant impact on problem complexity. The author Thomas Gabel addresses the intricacy of learning and acting in multi-agent systems by two complementary approaches. He identifies a subclass of general decentralized decision-making problems that features provably reduced complexity. Moreover, he presents various novel model-free multi-agent RL algorithms that are capable of quickly obtaining approximate solutions in the vicinity of the optimum. All algorithms proposed are evaluated in the scope of various established scheduling benchmark problems. 192 pp. Deutsch.
Lingua: Inglese
Editore: Südwestdeutscher Verlag für Hochschulschriften, 2017
ISBN 10: 3838110366 ISBN 13: 9783838110363
Da: moluna, Greven, Germania
EUR 79,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In a distributed system, a number of individually acting agents coexist. In order to achieve a common goal, coordinated cooperation between the agents is crucial. Many real-world applications are well-suited to be formulated in terms of spatially or functio.
Lingua: Inglese
Editore: Südwestdeutscher Verlag Für Hochschulschriften Aug 2009, 2009
ISBN 10: 3838110366 ISBN 13: 9783838110363
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 79,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In a distributed system, a number of individually acting agents coexist. In order to achieve a common goal, coordinated cooperation between the agents is crucial. Many real-world applications are well-suited to be formulated in terms of spatially or functionally distributed entities. Job-shop scheduling represents one such application. Multi-agent reinforcement learning (RL) methods allow for automatically acquiring cooperative policies based solely on a specification of the desired joint behavior of the whole system. However, the decentralization of the control and observation of the system among independent agents has a significant impact on problem complexity. The author Thomas Gabel addresses the intricacy of learning and acting in multi-agent systems by two complementary approaches. He identifies a subclass of general decentralized decision-making problems that features provably reduced complexity. Moreover, he presents various novel model-free multi-agent RL algorithms that are capable of quickly obtaining approximate solutions in the vicinity of the optimum. All algorithms proposed are evaluated in the scope of various established scheduling benchmark problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 192 pp. Deutsch.
Lingua: Inglese
Editore: Südwestdeutscher Verlag Für Hochschulschriften, 2009
ISBN 10: 3838110366 ISBN 13: 9783838110363
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 79,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In a distributed system, a number of individually acting agents coexist. In order to achieve a common goal, coordinated cooperation between the agents is crucial. Many real-world applications are well-suited to be formulated in terms of spatially or functionally distributed entities. Job-shop scheduling represents one such application. Multi-agent reinforcement learning (RL) methods allow for automatically acquiring cooperative policies based solely on a specification of the desired joint behavior of the whole system. However, the decentralization of the control and observation of the system among independent agents has a significant impact on problem complexity. The author Thomas Gabel addresses the intricacy of learning and acting in multi-agent systems by two complementary approaches. He identifies a subclass of general decentralized decision-making problems that features provably reduced complexity. Moreover, he presents various novel model-free multi-agent RL algorithms that are capable of quickly obtaining approximate solutions in the vicinity of the optimum. All algorithms proposed are evaluated in the scope of various established scheduling benchmark problems.