Search results

  1. 1.
    0422140 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
    Pudlák, Pavel
    On extracting computations from propositional proofs.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Wadem: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2010 - (Lodaya, K.; Mahajan, M.), s. 30-41. Leibniz International Proceedings in Informatics, vol. 8. ISBN 978-3-939897-23-1.
    [International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), /30./. Chennai (IN), 15.12.2010-16.12.2010]
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : proof complexity * propositional tautology * boolean circuits
    Subject RIV: BA - General Mathematics
    http://drops.dagstuhl.de/opus/volltexte/2010/2851/
    Permanent Link: http://hdl.handle.net/11104/0228350
    FileDownloadSizeCommentaryVersionAccess
    Pudlak2.pdf1424.5 KBPublisher’s postprintopen-access
     
     
  2. 2.
    0405648 - UIVT-O 336030 RIV PL eng C - Conference Paper (international conference)
    Coufal, David
    Coherence of Radial Implicative Fuzzy Systems with Nominal Consequents.
    [Koherence radiálních implikačních fuzzy systémů s nominálními konsekventy.]
    Decision Support for Telecommunications and Information Society. Warsaw: National Institute of Telecommunications, 2005, s. 201-214.
    [DSTIS 2005. International Conference on Decision Support for Telecommunications and Information Society /5./. Warsaw (PL), 01.09.2005-03.09.2005]
    R&D Projects: GA MŠMT 1M0545
    Keywords : implicative fuzzy systems * radial fuzzy systems * nominal output space * coherence
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125789
     
     
  3. 3.
    0405647 - UIVT-O 336029 RIV CN eng C - Conference Paper (international conference)
    Coufal, David
    Representation of Continuous Archimedean Radial Fuzzy Systems.
    [Radiální implifikační fuzzy systémy.]
    Fuzzy Logic, Soft Computing and Computational Intelligence. Vol. 2. Beijing: Tsinghua University Press and Springer, 2005 - (Liu, Y.; Chen, G.; Ying, M.), s. 1174-1179. ISBN 7-302-11377-7.
    [International Fuzzy Systems Association World Congress /11./. Beijing (CN), 28.07.2005-31.07.2005]
    R&D Projects: GA MŠMT 1M0545
    Keywords : radial fuzzy system * lp-norm * continuous Archimedean t-norm
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125788
     
     
  4. 4.
    0405532 - UIVT-O 330910 RIV CN eng C - Conference Paper (international conference)
    Běhounek, Libor - Cintula, Petr
    General Logical Formalism for Fuzzy Mathematics: Methodology and Apparatus.
    [Obecný logický formalismus pro fuzzy matematiku: metodologie a aparát.]
    Fuzzy Logic, Soft Computing and Computational Intelligence. Vol. 2. Beijing: Tsinghua University Press and Springer, 2005 - (Liu, Y.; Chen, G.; Ying, M.), s. 1227-1232. ISBN 7-302-11377-7.
    [International Fuzzy Systems Association World Congress /11./. Beijing (CN), 28.07.2005-31.07.2005]
    R&D Projects: GA AV ČR KJB100300502; GA MŠMT 1M0545
    Keywords : fuzzy logic * fuzzy mathematics * axiomatization * formalization * higher-order logic * LPi-logic
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125690
    FileDownloadSizeCommentaryVersionAccess
    0405532.pdf0576.3 KBAuthor´s preprintopen-access
     
     
  5. 5.
    0405294 - UIVT-O 330626 RIV DE eng C - Conference Paper (international conference)
    Šíma, Jiří
    Generating Sequential Triangle Strips by using Hopfield Nets.
    [Generování sekvenčních trojúhelníkových pásů pomocí Hopfieldových sítí.]
    Adaptive and Natural Computing Algorithms. Wien: Springer-Verlag, 2005 - (Ribiero, B.; Albrecht, R.; Dobnikar, A.; Pearson, D.; Steele, N.), s. 25-28. ISBN 3-211-24934-6.
    [ICANNGA'2005 /7./. Coimbra (PT), 21.03.2005-23.03.2005]
    R&D Projects: GA MŠMT(CZ) 1M0545; GA MŠMT LN00A056
    Keywords : sequential triangle strip * combinatorial optimization * Hopfield network * minimum energy * simulated annealing
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125474
    FileDownloadSizeCommentaryVersionAccess
    0405294.pdf01.8 MBAuthor´s preprintopen-access
     
     
  6. 6.
    0386905 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
    Ebenlendr, Tomáš - Sgall, J.
    A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
    Approximation and Online Algorithms. Heidelberg: Springer, 2012 - (Solis-Oba, R.; Persiano, G.), s. 102-108. Lecture Notes in Computer Science, 7164. ISBN 978-3-642-29115-9.
    [9th International Workshop, WAOA 2011. Saarbrücken (DE), 08.09.2011-09.09.2011]
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : algorithm analysis * problem complexity * computer science
    Subject RIV: BA - General Mathematics
    http://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
    Permanent Link: http://hdl.handle.net/11104/0219394
    FileDownloadSizeCommentaryVersionAccess
    Ebenlendr.pdf2168.5 KBPublisher’s postprintrequire
     
     
  7. 7.
    0386317 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
    Ada, A. - Chattopadhyay, A. - Cook, S.A. - Fontes, L. - Koucký, Michal - Pitassi, T.
    The hardness of being private.
    2012 IEEE 27th Annual Conference on Computational Complexity (CCC). New York: IEEE, 2012, s. 192-202. Annual IEEE Conference on Computational Complexity. ISBN 978-0-7695-4708-4. ISSN 1093-0159.
    [Computational Complexity (CCC), 2012 IEEE 27th Annual Conference. Porto (PT), 26.06.2012-29.6.2012]
    R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
    Institutional support: RVO:67985840
    Keywords : privacy * communication complexity * Vickrey auctions
    Subject RIV: BA - General Mathematics
    http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6243395
    Permanent Link: http://hdl.handle.net/11104/0215655
    FileDownloadSizeCommentaryVersionAccess
    Koucky.pdf1351.6 KBPublisher’s postprintrequire
     
     
  8. 8.
    0386309 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
    Gál, A. - Hansen, K.A. - Koucký, Michal - Pudlák, Pavel - Viola, E.
    Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
    Proceedings of the 44th Symposium on Theory of Computing, STOC'2012. New York: ACM, 2012 - (Karloff, H.; Pitassi, T.), s. 479-494. ISBN 978-1-4503-1245-5.
    [STOC'12 Symposium on Theory of Computing Conference /44./. New York (US), 19.05.2012-22.05.2012]
    R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
    Institutional support: RVO:67985840
    Keywords : error correcting codes * bounded depth circuits * superconcentrators
    Subject RIV: BA - General Mathematics
    http://dl.acm.org/citation.cfm?id=2213977.2214023&coll=DL&dl=GUIDE&CFID=245194486&CFTOKEN=14126751
    Permanent Link: http://hdl.handle.net/11104/0219390
    FileDownloadSizeCommentaryVersionAccess
    Koucky3.pdf1287.1 KBAuthor’s postprintrequire
     
     
  9. 9.
    0371008 - MÚ 2012 RIV SK eng C - Conference Paper (international conference)
    Zajíček, Ondřej
    Approximate throughput maximization in scheduling of parallel jobs on hypercubes.
    Information Technologies - Applications and Theory. Seňa: Pont, 2010 - (Pardubská, D.), s. 71-75. ISBN 978-80-970179-4-1.
    [ITAT 2010. Conference on Theory and Practice of Information Technologies. Smrekovica (SK), 21.09.2010-25.09.2010]
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : scheduling * hypercubes
    Subject RIV: BA - General Mathematics
    http://ceur-ws.org/Vol-683/paper11.pdf
    Permanent Link: http://hdl.handle.net/11104/0204656
    FileDownloadSizeCommentaryVersionAccess
    Zajicek.pdf1231.5 KBPublisher’s postprintopen-access
     
     
  10. 10.
    0370314 - MÚ 2012 RIV DE eng C - Conference Paper (international conference)
    Chrobak, M. - Sgall, Jiří - Jeż, Łukasz
    Better bounds for incremental frequency allocation in bipartite graphs.
    Algorithms - ESA 2011. Berlin: Springer, 2011 - (Demetrescu, C.; Halldórsson, M.), s. 251-262. Lecture Notes in Computer Science, 6942. ISBN 978-3-642-23718-8.
    [19th Annual European Symposium. Saarbrücken (DE), 05.09.2011-09.09.2011]
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : asymptotic competitive ratio * bipartite graphs * different frequency
    Subject RIV: BA - General Mathematics
    http://www.springerlink.com/content/h25t5313l2u32n62/
    Permanent Link: http://hdl.handle.net/11104/0204153
    FileDownloadSizeCommentaryVersionAccess
    Sgall.pdf1277.2 KBPublisher’s postprintrequire
     
     

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