Search results

  1. 1.
    0404160 - UIVT-O 20000247 CZ eng V - Research Report
    Beran, Martin
    Formalizing, Analyzing and Extending the Model of Bulk Synchronous Parallel Computer.
    Prague: ICS AS CR, 2000. 92 s. Technical Report, V-829.
    R&D Projects: GA ČR GA201/00/1489
    Institutional research plan: AV0Z1030915
    Keywords : model of computation * parallel computers * parallel algorithms * BSP * dBSP * machine classes * pipelining
    Permanent Link: http://hdl.handle.net/11104/0124427
    FileDownloadSizeCommentaryVersionAccess
    v829-00.pdf9699.5 KBOtheropen-access
     
     
  2. 2.
    0364445 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
    Petrů, Lukáš - Wiedermann, Jiří
    A Universal Flying Amorphous Computer.
    Unconventional Computation. Berlin: Springer, 2011 - (Calude, C.; Kari, J.; Petre, I.; Rozenberg, G.), s. 189-200. Lecture Notes in Computer Science, 6714. ISBN 978-3-642-21340-3. ISSN 0302-9743.
    [UC 2011. Unconventional Computation /10/. Turku (FI), 06.06.2011-10.06.2011]
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : amorphous computing * model of computation * universality
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0199930
    FileDownloadSizeCommentaryVersionAccess
    a0364445.pdf0171.4 KBPublisher’s postprintrequire
     
     
  3. 3.
    0352556 - ÚI 2011 CZ eng V - Research Report
    Petrů, L. - Wiedermann, Jiří
    A Universal Flying Amorphous Computer.
    Prague: ICS AS CR, 2010. 10 s. Technical Report, V-1097.
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : amorphous computing * model of computation * universality
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0192042
    FileDownloadSizeCommentaryVersionAccess
    v1097-10.pdf21289.9 KBOtheropen-access
     
     


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