Search results
- 1.0175345 - MU-W 20030097 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří
Analysis of the { Harmonic } algorithm for three servers.
Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science. Berlin: Springer, 2003, s. 247-259. Lecture Notes in Computer Science., 2607.
[Annual Symposium on Theoretical Aspects of Computer Science/20./. Berlin (DE), 27.02.2003-01.03.2003]
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476; GA AV ČR IAA1019901
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : online algorithms * server problem * random walk
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072329 - 2.0175226 - MU-W 20020114 RIV ES eng C - Conference Paper (international conference)
Chrobak, M. - Epstein, L. - Noga, J. - Sgall, Jiří - van Stee, R. - Tichý, Tomáš - Vakhania, N.
Preemptive scheduling in overloaded systems.
Proceedings of the 29th International Colloquium on Automata, Languages, and Programming. Berlin: SpringerVerlag, 2002, s. 800-811.
[International Colloquium on Automata, Languages, and Programming/29./. Malaga (ES), 08.07.2002-13.07.2002]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : scheduling * online algorithms * benefit
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072211 - 3.0106817 - MU-W 20040024 RIV CZ eng C - Conference Paper (international conference)
Tichý, Tomáš
A Lower Bound for Restricted Randomized On-line Algorithms for Scheduling.
[Dolní odhad pro omezené pravděpodobnostní online algoritmy pro rozvrhování.]
Proceedings of the Week for Doctoral Studentďs 2002. Praha: MATFYZPRESS, 2002, s. 21-26.
[Week for Doctoral Studentďs 2002. Praha (CZ), 11.06.2002-14.06.2002]
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476
Institutional research plan: CEZ:AV0Z1019905
Keywords : online * randomized * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0013991 - 4.0106816 - MU-W 20040023 RIV DE eng C - Conference Paper (international conference)
Bartal, Y. - Chin, F. Y. L. - Chrobak, M. - Fung, S. P. Y. - Jawor, W. - Lavi, R. - Sgall, Jiří - Tichý, Tomáš
Online competitive algorithms for maximizing weighted throughput of unit jobs.
[Online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy.]
Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS). Berlin: SpringerVerlag, 2004, s. 187-198.
[Annual Symposium on Theoretical Aspects of Computer Science/21./. Montpellier (FR), 25.03.2004-27.03.2004]
R&D Projects: GA MŠMT LN00A056; GA MŠMT ME 476; GA ČR GA201/01/1195; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905
Keywords : online scheduling * unit jobs * deadlines
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0013990File Download Size Commentary Version Access Sgall.pdf 1 219.9 KB Author´s preprint open-access - 5.0106815 - MU-W 20040022 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, T. - Sgall, Jiří
Optimal and online preemptive scheduling on uniformly related machines.
[Optimální a online rozvrhování na uniformních počítačích.]
Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS). Berlin: SpringerVerlag, 2004, s. 199-210. ISBN 3-540-21236-1.
[Annual Symposium on Theoretical Aspects of Computer Science/21./. Montpellier (FR), 25.03.2004-27.03.2004]
R&D Projects: GA MŠMT LN00A056; GA MŠMT ME 476; GA ČR GA201/01/1195; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905
Keywords : online scheduling * preemption * uniformly related machines
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0013989