( en | de | ru )

 

Disambiguation of "Rudek, Radoslaw"

Author of the publication

copydeleteadd this publication to your clipboard
An optimal sequence of tasks for autonomous learning systems.

, , and . MMAR, page 16-21. IEEE, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christof Rudek

Marcelo Rudek

Susanne Rudek-Vennefrohne

Barb Rudek

Reiner Rudek

 

Other publications of authors with the same name

Heuristic workload scheduling algorithms for rolling stocks with mixed preventive maintenance policies., and . MMAR, page 297-302. IEEE, (2021)An Enhancement of Reinforcement Learning by Scheduling with Learning Effects.. FedCSIS, volume 35 of Annals of Computer Science and Information Systems, page 689-697. (2023)Resource Allocation Problems in Network Processors for the Future Internet., , , and . KES, volume 243 of Frontiers in Artificial Intelligence and Applications, page 1509-1520. IOS Press, (2012)An optimal sequence of tasks for autonomous learning systems., , and . MMAR, page 16-21. IEEE, (2011)Introduction to Multi-Agent Modified Q-Learning Routing for Computer Networks., , and . AICT/SAPIR/ELETE, page 408-413. IEEE Computer Society, (2005)The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect.. Appl. Math. Comput., 218 (11): 6498-6510 (2012)A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times.. Optim. Lett., 7 (3): 613-616 (2013)On Scheduling Problems with an Intelligent Use of the Learning Effect., , and . ACIIDS, page 7-12. IEEE Computer Society, (2009)A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times.. Optim. Lett., 6 (5): 1021-1025 (2012)Parallel computation approach to solve total cost minimization scheduling problem., , and . MMAR, page 22-26. IEEE, (2011)