Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Michal Tanas"'
Publikováno v:
RAIRO - Operations Research. 46:335-353
The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c069dc72eea889dddfac39bbce448096
https://doi.org/10.1051/ro/2012020
https://doi.org/10.1051/ro/2012020
Publikováno v:
Journal of Scheduling. 13:453-461
The coupled tasks scheduling problem was originally introduced for modeling complex radar devices. It is still used for controlling such devices and applied in similar applications. This paper considers a problem of coupled tasks scheduling on a sing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6cfee571a9e184faf9961f8186541d6
https://doi.org/10.1007/s10951-010-0167-z
https://doi.org/10.1007/s10951-010-0167-z
Publikováno v:
EISIC
This paper describes the TALOS, which is an experimental system designed to test suitability of automatic vehicles to nearly autonomously (i.e. without constant human supervision) perform routine patrol duties for the Border Guard. The goal of the TA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0baa74b7d5df8885b69ab0f9ea6fef6b
https://doi.org/10.1109/eisic.2012.60
https://doi.org/10.1109/eisic.2012.60
Publikováno v:
MMAR
This paper describes the TALOS project, which is a new way to use autonomous robotic vehicles to strengthen the security of land borders of the European Union. The existing system, based on a network of fixed Border Guard posts and routine patrols of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a7c9a0c054e08e3cf3564c919ba8f53
https://doi.org/10.1109/mmar.2011.6031369
https://doi.org/10.1109/mmar.2011.6031369
Publikováno v:
Scopus-Elsevier
Journal of the Brazilian Computer Society v.7 n.3 2001
Journal of the Brazilian Computer Society
Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
Journal of the Brazilian Computer Society, Volume: 7, Issue: 3, Pages: 23-26, Published: 2001
Journal of the Brazilian Computer Society v.7 n.3 2001
Journal of the Brazilian Computer Society
Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
Journal of the Brazilian Computer Society, Volume: 7, Issue: 3, Pages: 23-26, Published: 2001
This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion is to minimise the schedule length. This problem is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cfb5c7749642b82f10b49a264a0a4365
http://www.scopus.com/inward/record.url?eid=2-s2.0-52549087344&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-52549087344&partnerID=MN8TOARS
