Zobrazeno 1 - 10
of 107
pro vyhledávání: '"FEUERSTEIN, E."'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dumoulin, C., Biasolo, C., Feuerstein, E., Bedoucha, C., Gayral, M., Barnetche, S., Gratelle, M.-A., Dulin, R., Marion, A.-C.
Publikováno v:
In Le Pharmacien Clinicien December 2022 57(4):e151-e152
Autor:
Wilfinger, T.1 (AUTHOR) thomas.wilfinger@rhp-technology.com, Feuerstein, E.1 (AUTHOR), Kitzmantel, M.1 (AUTHOR), Neubauer, E.1 (AUTHOR), Tajmar, M.2 (AUTHOR)
Publikováno v:
Powder Metallurgy. Sep2015, Vol. 58 Issue 4, p241-245. 5p. 9 Black and White Photographs, 1 Diagram, 2 Charts.
Autor:
FEUERSTEIN, E.
Publikováno v:
Quarterly of Applied Mathematics, 1957 Jul 01. 15(2), 183-192.
Externí odkaz:
https://www.jstor.org/stable/43634444
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Scheduling, 6(2), 167-181. Springer
Journal of Scheduling, 6(2), 167-181. Springer New York
Feuerstein, E, Mydlarz, M & Stougie, L 2003, '
multi-threaded scheduling ', Journal of Scheduling, vol. 6, no. 2, pp. 167-181 . https://doi.org/10.1023/A:1022987804726
Journal of Scheduling, 6(2), 167-181. Springer New York
Feuerstein, E, Mydlarz, M & Stougie, L 2003, '
multi-threaded scheduling ', Journal of Scheduling, vol. 6, no. 2, pp. 167-181 . https://doi.org/10.1023/A:1022987804726
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ba853d569a55333ac209186d7451f46
https://research.tue.nl/nl/publications/6bea81ca-294b-4194-aa05-d55490664a15
https://research.tue.nl/nl/publications/6bea81ca-294b-4194-aa05-d55490664a15
Publikováno v:
Algorithmica, 29(4), 560-581. Springer New York
Ausiello, G, Feuerstein, E, Leonardi, S, Stougie, L & Talamo, M 2001, ' Algorithms for the
travelling salesman ', Algorithmica, vol. 29, no. 4, pp. 560-581 . https://doi.org/10.1007/s004530010071
Scopus-Elsevier
Algorithmica, 29(4), 560-581. Springer
Ausiello, G, Feuerstein, E, Leonardi, S, Stougie, L & Talamo, M 2001, ' Algorithms for the
travelling salesman ', Algorithmica, vol. 29, no. 4, pp. 560-581 . https://doi.org/10.1007/s004530010071
Scopus-Elsevier
Algorithmica, 29(4), 560-581. Springer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bcad66d61c2a741a0e2835b4e05d0572
http://hdl.handle.net/11573/255261
http://hdl.handle.net/11573/255261
In this paper the problem of efficiently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line Travelling Salesman Problem (OLTSP). It has a variety of relev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::a3472b523b5025a776ad1d3c278d2f8f
https://research.tue.nl/nl/publications/12ceb933-45d2-4e95-9d8c-7fe0a9f8f983
https://research.tue.nl/nl/publications/12ceb933-45d2-4e95-9d8c-7fe0a9f8f983
This paper presents results on on-line scheduling problems with multiple threads. The jobs are organized in a number of sequences called threads. Each job becomes available (is presented) only at the moment a scheduling decision is made on all the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::17ad86896362e0e7ea2b2a3eb974593f
https://research.tue.nl/nl/publications/c35d15d0-09eb-4163-a0e2-03b51589fed7
https://research.tue.nl/nl/publications/c35d15d0-09eb-4163-a0e2-03b51589fed7
Autor:
Feuerstein, E., Stougie, L.
In this paper results on the dial-a-ride problem with a single server are presented. Requests for rides consist of two points in a metric space, a source and a destination. A ride has to be made by the server from the source to the destination. The s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4527808552863deeb2f8fe06de227508
https://research.tue.nl/nl/publications/bdc4166c-f218-40fa-b8ba-38ecdbd38e1e
https://research.tue.nl/nl/publications/bdc4166c-f218-40fa-b8ba-38ecdbd38e1e