An algorithm for finding reliably schedulable plans

Bálint Takács, István Szita, A. Lőrincz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For interacting agents in time-critical applications, learning whether a subtask can be scheduled reliably is an important issue. The identification of sub-problems of this nature may promote e.g. planning, scheduling and segmenting in Markov decision processes. We define a subtask to be schedulable if its execution time has a small variance. We present an algorithm for finding such subtasks.

Original languageEnglish
Title of host publicationIEEE International Conference on Neural Networks - Conference Proceedings
Pages2257-2261
Number of pages5
Volume3
DOIs
Publication statusPublished - 2004
Event2004 IEEE International Joint Conference on Neural Networks - Proceedings - Budapest, Hungary
Duration: Jul 25 2004Jul 29 2004

Other

Other2004 IEEE International Joint Conference on Neural Networks - Proceedings
CountryHungary
CityBudapest
Period7/25/047/29/04

Fingerprint

Scheduling
Planning

ASJC Scopus subject areas

  • Software

Cite this

Takács, B., Szita, I., & Lőrincz, A. (2004). An algorithm for finding reliably schedulable plans. In IEEE International Conference on Neural Networks - Conference Proceedings (Vol. 3, pp. 2257-2261) https://doi.org/10.1109/IJCNN.2004.1380973

An algorithm for finding reliably schedulable plans. / Takács, Bálint; Szita, István; Lőrincz, A.

IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 3 2004. p. 2257-2261.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takács, B, Szita, I & Lőrincz, A 2004, An algorithm for finding reliably schedulable plans. in IEEE International Conference on Neural Networks - Conference Proceedings. vol. 3, pp. 2257-2261, 2004 IEEE International Joint Conference on Neural Networks - Proceedings, Budapest, Hungary, 7/25/04. https://doi.org/10.1109/IJCNN.2004.1380973
Takács B, Szita I, Lőrincz A. An algorithm for finding reliably schedulable plans. In IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 3. 2004. p. 2257-2261 https://doi.org/10.1109/IJCNN.2004.1380973
Takács, Bálint ; Szita, István ; Lőrincz, A. / An algorithm for finding reliably schedulable plans. IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 3 2004. pp. 2257-2261
@inproceedings{fa1f7feecf1e46e5a1c4056a3e263cc8,
title = "An algorithm for finding reliably schedulable plans",
abstract = "For interacting agents in time-critical applications, learning whether a subtask can be scheduled reliably is an important issue. The identification of sub-problems of this nature may promote e.g. planning, scheduling and segmenting in Markov decision processes. We define a subtask to be schedulable if its execution time has a small variance. We present an algorithm for finding such subtasks.",
author = "B{\'a}lint Tak{\'a}cs and Istv{\'a}n Szita and A. Lőrincz",
year = "2004",
doi = "10.1109/IJCNN.2004.1380973",
language = "English",
isbn = "0780383591",
volume = "3",
pages = "2257--2261",
booktitle = "IEEE International Conference on Neural Networks - Conference Proceedings",

}

TY - GEN

T1 - An algorithm for finding reliably schedulable plans

AU - Takács, Bálint

AU - Szita, István

AU - Lőrincz, A.

PY - 2004

Y1 - 2004

N2 - For interacting agents in time-critical applications, learning whether a subtask can be scheduled reliably is an important issue. The identification of sub-problems of this nature may promote e.g. planning, scheduling and segmenting in Markov decision processes. We define a subtask to be schedulable if its execution time has a small variance. We present an algorithm for finding such subtasks.

AB - For interacting agents in time-critical applications, learning whether a subtask can be scheduled reliably is an important issue. The identification of sub-problems of this nature may promote e.g. planning, scheduling and segmenting in Markov decision processes. We define a subtask to be schedulable if its execution time has a small variance. We present an algorithm for finding such subtasks.

UR - http://www.scopus.com/inward/record.url?scp=10844256523&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10844256523&partnerID=8YFLogxK

U2 - 10.1109/IJCNN.2004.1380973

DO - 10.1109/IJCNN.2004.1380973

M3 - Conference contribution

SN - 0780383591

VL - 3

SP - 2257

EP - 2261

BT - IEEE International Conference on Neural Networks - Conference Proceedings

ER -