Search results

  1. 1.
    0405595 - UIVT-O 330975 SIGLE CZ eng V - Research Report
    Wiedermann, Jiří - Pardubská, D.
    On the Power of Broadcasting in Mobile Computing.
    Prague: ICS AS CR, 2005. 15 s. Technical Report, V-944.
    R&D Projects: GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : wireless computing * Turing machines * alternation * complexity
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125749
    FileDownloadSizeCommentaryVersionAccess
    v944-05.pdf15257.7 KBOtheropen-access
     
     
  2. 2.
    0405383 - UIVT-O 330755 SIGLE CZ eng V - Research Report
    Wiedermann, Jiří
    Autopoietic Automata.
    Prague: ICS AS CR, 2005. 10 s. Technical Report, V-929.
    R&D Projects: GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : self-reproducing automaton * interactive Turing machine * evolution
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125555
    FileDownloadSizeCommentaryVersionAccess
    v929-05.pdf16226.3 KBOtheropen-access
     
     
  3. 3.
    0338520 - ÚI 2010 CZ eng V - Research Report
    Žák, Stanislav
    Branching Programs: Paradoxes in the Method.
    Prague: ICS AS CR, 2009. 16 s. Technical Report, V-1052.
    R&D Projects: GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : branching programs * lower bound techniques
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0182270
    FileDownloadSizeCommentaryVersionAccess
    v1052-09.pdf18243.1 KBOtheropen-access
     
     
  4. 4.
    0331769 - ÚI 2010 CZ eng V - Research Report
    Vaculín, Roman - Neruda, Roman - Sycara, K.
    Towards a Process Mediation Framework for Semantic Web Service.
    Prague: ICS AS CR, 2008. 24 s. Technical Report, V-1048.
    R&D Projects: GA MŠMT ME08095; GA AV ČR 1ET100300517
    Grant - others:DARPA FA865006C7606
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : process mediation, semantic web services, agents and web services, automated planning
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0177200
    FileDownloadSizeCommentaryVersionAccess
    v1048-08.pdf15421.9 KBOtheropen-access
     
     
  5. 5.
    0331291 - ÚI 2010 CZ eng V - Research Report
    Šíma, Jiří - Žák, Stanislav
    A Characterization of Hitting Sets for 1-Branching Programs of Width 3 (Revised Version).
    Prague: ICS AS CR, 2009. 18 s. Technical Report, V-1054.
    R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : derandomization, hitting set * hitting set * read-once branching programs * bounded width
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0176844
    FileDownloadSizeCommentaryVersionAccess
    v1054-09.pdf16253 KBOtheropen-access
     
     
  6. 6.
    0318940 - ÚI 2009 SIGLE CZ eng V - Research Report
    Šíma, Jiří
    Gradient Learning in Networks of Smoothly Spiking Neurons (Revised Version).
    Prague: ICS AS CR, 2009. 12 s. Technical Report, V-1045.
    R&D Projects: GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : spiking neuron * back-propagation * SpikeProp * gradient learning
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0168229
    FileDownloadSizeCommentaryVersionAccess
    v1045-09.pdf19328.2 KBOtheropen-access
     
     
  7. 7.
    0316228 - ÚI 2009 SIGLE CZ eng V - Research Report
    Běhounek, Libor - Bodenhofer, U. - Cintula, Petr - Sarkoci, P. - Saminger-Platz, S.
    Graded Properties of Binary Fuzzy Connectives.
    Prague: ICS AS CR, 2008. 12 s. Technical Report, V-1042.
    R&D Projects: GA AV ČR IAA100300503; GA AV ČR 1ET100300517
    Grant - others:Program Kontakt/WTZ CR-Austria(EU) 6-07-17/2-2007
    Institutional research plan: CEZ:AV0Z10300504
    Source of funding: V - Other public resources
    Keywords : connectives * fuzzy class theory * dominance
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0166215
    FileDownloadSizeCommentaryVersionAccess
    v1042-08.pdf15228.6 KBOtheropen-access
     
     
  8. 8.
    0313794 - ÚI 2009 SIGLE CZ eng V - Research Report
    Šíma, Jiří - Žák, Stanislav
    A Characterization of Hitting Sets for 1 Branching Programs of Width 3.
    Prague: ICS AS CR, 2008. 11 s. Technical Report, V-1029.
    R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : derandomization, hitting set * branching programs of bounded width
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0164506
    FileDownloadSizeCommentaryVersionAccess
    v1029-08.pdf0207.8 KBOtherrequire
     
     
  9. 9.
    0090522 - ÚI 2008 SIGLE CZ eng V - Research Report
    Žák, Stanislav
    A Superpolynomial Lower Bound for a Class of Restricted Branching Programs.
    Prague: ICS AS CR, 2007. 9 s. Technical Report, V-1012.
    R&D Projects: GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : branching programs * lower bound techniques
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0151389
    FileDownloadSizeCommentaryVersionAccess
    v1012-07.pdf15209.1 KBOtheropen-access
     
     
  10. 10.
    0088406 - ÚI 2008 SIGLE CZ eng V - Research Report
    Šíma, Jiří
    Gradient Learning in Networks of Smoothly Spiking Neurons.
    Prague: ICS AS CR, 2007. 9 s. Technical Report, V-1004.
    R&D Projects: GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : spiking neuron * back-propagation * SpikeProp * gradient learning
    Permanent Link: http://hdl.handle.net/11104/0149949
    FileDownloadSizeCommentaryVersionAccess
    v1004-07.pdf0148.4 KBOtherrequire
     
     

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