Basket

  1. 1.
    0334971 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
    Ebenlendr, Tomáš - Sgall, Jiří
    A lower bound for scheduling of unit jobs with immediate decision on parallel machines.
    [Dolní odhad pro rozhodování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.]
    Approximation and online algorithms. Berlin: Springer, 2009 - (Bampis, E.; Skutella, M.), s. 43-52. Lecture notes in computer science, 5426. ISBN 978-3-540-93979-5.
    [6th International Workshop on Approximation and Online Algorithms. Karlsruhe (DE), 18.09.2008-19.09.2008]
    R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : online algorithms * scheduling
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0179571
    FileDownloadSizeCommentaryVersionAccess
    Sgall.pdf12.1 MBAuthor’s postprintopen-access
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.